首页 > 其他 > 详细

66. Plus One

时间:2016-04-11 00:10:47      阅读:329      评论:0      收藏:0      [点我收藏+]

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 public:
 3     vector<int> plusOne(vector<int>& digits) {
 4         
 5         for (auto iter = digits.rbegin(); iter != digits.rend(); ++iter)
 6         {
 7             if (*iter <= 8)
 8             {
 9                 *iter += 1;
10 
11                 return digits;
12             }
13             else
14             {
15                 if (iter != (digits.rend() - 1))
16                 {
17                     *iter = 0;
18                 }
19                 else
20                 {
21                     *iter = 1;
22                     digits.push_back(0);
23 
24                     return digits;
25                 }
26             }
27         }
28     }
29 };

 

66. Plus One

原文:http://www.cnblogs.com/lijiatu/p/5376471.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!