Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1:
Input: [1,2,3] Output: [1,2,4] Explanation: The array represents the integer 123.
Example 2:
Input: [4,3,2,1] Output: [4,3,2,2] Explanation: The array represents the integer 4321.
Solution: Big Integer
Process from right to left (lest significant to most signification). Use carry to indicate whether need +1 for next digit or not.
Time complexity: O(n)
Space complexity: O(n)
c++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
class Solution { public: vector<int> plusOne(vector<int>& digits) { int carry = 1; for (int i = digits.size() - 1; i >= 0; --i) { digits[i] += carry; carry = digits[i] / 10; digits[i] %= 10; } if (carry) digits.insert(begin(digits), carry); return digits; } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment