[LeetCode] Plus One

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

 

复制代码
 1 class Solution
 2 {
 3     public:
 4     vector<int> plusOne(vector<int> &digits)
 5     {   
 6         int carry =  1;  
 7         int tmp = 0;
 8         for(int i = digits.size()-1; i >=0; i--)
 9         {   
10             tmp =  digits[i] + carry;
11             digits[i] =  tmp % 10; 
12             carry  =  tmp / 10; 
13         }   
14         if(carry != 0)
15             digits.insert(digits.begin() ,carry);
16         return digits;
17     }   
18 } ;
复制代码

 

 

 

 

 

posted @   穆穆兔兔  阅读(169)  评论(0编辑  收藏  举报
点击右上角即可分享
微信分享提示