Discuss

二.解题技巧

三.实现代码

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


class Solution
{
public:
    vector<int> plusOne(vector<int> &digits)
    {
        int Carry = 1;
        const int SIZE = digits.size();
        int Tmp = 0;

        // add one
        for (int Index = SIZE - 1; Index >= 0; Index--)
        {
            Tmp = digits[Index] + Carry;
            if (Tmp < 10)
            {
                Carry = 0;
                digits[Index] = Tmp;
                break;
            }

            Carry = 1;
            digits[Index] = Tmp - 10;
        }


        vector<int> Result;

        if (Carry == 1)
        {
            Result.push_back(1);
        }


        for (int Index = 0; Index < SIZE; Index++)
        {
            Result.push_back(digits[Index]);
        }


        return Result;
    }
};

四.体会