[leetcode] 66. Plus One

标签：tin   dig   return   one   list   nts   put   思路   mos   

原题:

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后首位为0的情况.

c++代码实现:

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int k = digits.size()-1;
        for(int i=k; i>=0;i--)
        {
            if(digits[i]==9)
                digits[i]=0;
            else
            {
                digits[i]+=1;
                return digits;
            }
        }
        if(digits[0]==0)
            digits.insert(digits.begin(),1);
    return digits;
    }
};

[leetcode] 66. Plus One

标签：tin   dig   return   one   list   nts   put   思路   mos   

原文地址：https://www.cnblogs.com/guweixin/p/10413865.html