LeetCode OJ---66. Plus One

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.

// 算法设计得相当巧妙，可以多学习学习
class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        for(int i=digits.size() - 1; i>=0; i--)
        {
            if(digits[i] != 9)
            {
                digits[i] +=1;
                return digits;
            }
            else
            {
                digits[i] = 0;
            }
        }
        digits.push_back(0);
        digits[0] = 1;
        return digits;
    }
};