【leetccode】66. Plus One（c/c++，easy难度）

原题链接 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.

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.

---

算法

思路1:从后往前遍历，进位时标记进位位tag（然而runtime 4ms beats 6 percent）

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
           int len = digits.size();
    int sum = 0;
    int tag = 0;//标记进位
    if(digits[len-1] != 9) digits[len-1] += 1;
    else{
        digits[len-1] = 0;
        tag = 1;
    }

    for(int i = len-2 ;i >= 0 ;i--){
        if(tag == 1){
            if(digits[i] != 9)
            {
                digits[i] += 1;
                tag = 0;
            }
            else{
                digits[i] = 0;
                tag = 1;
            }
        }else break;
    }
         if(tag){
        digits.insert(digits.begin(),1);
    }

        return digits;
    }
};