Plus One (Easy)

Description

Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.

Analysis

简单模拟.字符串模拟+1操作。

My Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
//C++
class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        int i ;
        for(i = digits.size()-1;i>=0;i--){
            if(digits[i]!=9)
            {
                digits[i]++;
                break;
            }
            else
                digits[i] = 0;
        }
        if(i==-1){
            digits[0]=1;
            digits.push_back(0);
        }
        return digits;
    }
};