首页 > 其他 > 详细

Plus One

时间:2014-04-05 18:06:12      阅读:575      评论:0      收藏:0      [点我收藏+]

Given a 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.

bubuko.com,布布扣
 1 class Solution {
 2 public:
 3     vector<int> plusOne(vector<int> &digits) {
 4         int carry = 1;
 5         for(int i = digits.size()-1; i >= 0 && carry; i--) {
 6             int sum = carry + digits[i];
 7             carry = sum / 10;
 8             digits[i] = sum % 10;
 9         }
10         if(carry == 1) {
11             digits.insert(digits.begin(), 1);
12         }
13         return digits;
14     }
15 };
bubuko.com,布布扣

 

Plus One,布布扣,bubuko.com

Plus One

原文:http://www.cnblogs.com/zhengjiankang/p/3646845.html

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