{"id":4817,"date":"2019-02-10T01:12:20","date_gmt":"2019-02-10T09:12:20","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=4817"},"modified":"2019-02-10T02:19:25","modified_gmt":"2019-02-10T10:19:25","slug":"leetcode-989-add-to-array-form-of-integer","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/simulation\/leetcode-989-add-to-array-form-of-integer\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 989. Add to Array-Form of Integer"},"content":{"rendered":"\n

For a non-negative integer X<\/code>, the array-form of X<\/code><\/em> is an array of its digits in left to right order.  For example, if X = 1231<\/code>, then the array form is [1,2,3,1]<\/code>.<\/p>\n\n\n\n

Given the array-form A<\/code> of a non-negative integer X<\/code>, return the array-form of the integer X+K<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input: <\/strong>A = [1,2,0,0], K = 34\nOutput: <\/strong>[1,2,3,4]\nExplanation: <\/strong>1200 + 34 = 1234\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input: <\/strong>A = [2,7,4], K = 181\nOutput: <\/strong>[4,5,5]\nExplanation: <\/strong>274 + 181 = 455\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input: <\/strong>A = [2,1,5], K = 806\nOutput: <\/strong>[1,0,2,1]\nExplanation: <\/strong>215 + 806 = 1021\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input: <\/strong>A = [9,9,9,9,9,9,9,9,9,9], K = 1\nOutput: <\/strong>[1,0,0,0,0,0,0,0,0,0,0]\nExplanation: <\/strong>9999999999 + 1 = 10000000000\n<\/pre>\n\n\n\n
Note\uff1a<\/strong><\/p>\n\n\n\n
  1. 1 <= A.length <= 10000<\/code><\/li>
  2. 0 <= A[i] <= 9<\/code><\/li>
  3. 0 <= K <= 10000<\/code><\/li>
  4. If A.length > 1<\/code>, then A[0] != 0<\/code><\/li><\/ol>\n\n\n\n
    Solution: Simulation<\/h2>\nTime complexity: O(n)\nSpace complexity: O(n)\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua, running time: 136 ms, 10.1 MB\nclass Solution {\npublic:\n  vector addToArrayForm(vector& A, int K) {\n    vector ans;\n    ans.reserve(A.size() + 1);    \n    for (int i = A.size() - 1; i >= 0 || K > 0; --i) {\n      K += (i >= 0 ? A[i] : 0);\n      ans.push_back(K % 10);\n      K \/= 10;\n    }    \n    reverse(begin(ans), end(ans));\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    For a non-negative integer X, the array-form of X is an array of its digits in left to right order.  For example, if X = 1231, then the array form…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[48],"tags":[222,464,31,179],"class_list":["post-4817","post","type-post","status-publish","format-standard","hentry","category-simulation","tag-easy","tag-high-precision","tag-math","tag-simulation","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4817","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=4817"}],"version-history":[{"count":6,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4817\/revisions"}],"predecessor-version":[{"id":4823,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4817\/revisions\/4823"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=4817"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=4817"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=4817"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}