码迷,mamicode.com
首页 > 其他好文 > 详细

Plus One

时间:2015-03-20 10:58:09      阅读:136      评论: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.

vector<int> plusOne(vector<int> &digits) {
	int  lastplus = 1;
	for (auto iter = digits.rbegin(); iter != digits.rend();++iter)
	{
		int sum = *iter +lastplus;
		if (sum<10){
			*iter = sum;
			lastplus = 0;
			break;
		}
		else{
			*iter = sum % 10;
			lastplus = 1;
		}
	}
	if (lastplus == 1)
		digits.insert(digits.begin(), 1);
	return digits;
}


 

Plus One

标签:

原文地址:http://blog.csdn.net/li_chihang/article/details/44487801

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!