LeetCode [66] Plus One

 66. Plus One

Easy

Given a non-empty array of digits representing a non-negative integer, increment 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 contains a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

 

Example 1:

Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

Example 3:

Input: digits = [0]
Output: [1]

 

Constraints:

• 1 <= digits.length <= 100
• 0 <= digits[i] <= 9

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

//C++: method1 4ms class Solution { public: vector<int> plusOne(vector<int>& digits) { int n = digits.size(); vector<int> res(n); int c = 1; for(int i=n-1; i>=0; --i){ int s = c+digits[i]; c = s/10; res[i] = s%10; } if(c) res.insert(res.begin(), c); return res; } };

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

class Solution { public int[] plusOne(int[] digits) { int n = digits.length; List<Integer> list = new ArrayList<>(); int c = 1; for(int i=n-1; i>=0; --i){ int r = c+digits[i]; list.add(r%10); c = r/10; } if(c!=0) list.add(c); int sz = list.size(); int[] res = new int[sz]; for(int i=sz-1; i>=0; --i){ res[sz-1-i] = list.get(i); } return res; } }