Plus One

最新推荐文章于 2021-05-14 00:39:03 发布

原创最新推荐文章于 2021-05-14 00:39:03 发布 · 553 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种方法，用于给非负数表示为数组的数字加一。通过遍历数组并更新数值，实现了对数字的加一操作。

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;
}