本文共 1100 字，大约阅读时间需要 3 分钟。

66. Plus One

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

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.

Solution

Brute Force

4 ms 9.1 MB

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