Home LeetCode - 66. Plus One
Post
Cancel

LeetCode - 66. Plus One

66. Plus One - easy

문제

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.

제한사항

입출력 예

1
2
3
4
5
Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
1
2
3
4
5
6
Example 2:

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

풀이

  • math
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int carry = 0;
        
        ++digits[digits.size()-1];
            
        for(auto i = digits.rbegin() ; i != digits.rend() ; ++i){
            if(*i + carry >= 10){
                *i = (*i + carry) % 10;
                carry = 1;
            }
            else{
                *i = (*i + carry);
                carry = 0;
            }
        }
        
        if(carry == 1)
            digits.insert(digits.begin(), 1);
        
        return digits;
    }
};
This post is licensed under CC BY 4.0 by the author.