leetcode(66)--Plus One

版权声明：本文为博主编写文章，未经博主允许转载，转载请注明出处： https://blog.csdn.net/qq_39742013/article/details/83189278

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        vector<int> temp=vector<int>();
        vector<int> result=vector<int>();
        int curAdd=1;
        for(int i=digits.size()-1;i>=0;i--)
        {
            if(curAdd!=0)
            {
                int sum=digits[i]+curAdd;   //防止更新了curAdd又用新的curAdd计算curV
                curAdd=sum/10;
                int curV=(sum)%10;
                temp.push_back(curV);
            }
            else 
            {
                temp.push_back(digits[i]);
            }
        }
        if(curAdd!=0)   //判断是否进位
            temp.push_back(curAdd);
        for(int i=temp.size()-1;i>=0;i--)
        {
            result.push_back(temp[i]);
        }
        return result;
        
    }
};