Leetcode之 Plus One

最新推荐文章于 2025-09-13 14:08:34 发布

原创最新推荐文章于 2025-09-13 14:08:34 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode和机试题专栏收录该内容

509 篇文章

订阅专栏

本文介绍了一个关于整数加一的算法实现，输入为一个非空数组，代表一个非负整数，需要对该整数加一。文章通过具体示例展示了如何逐位处理进位，并提供了完整的C++代码实现。

题目：

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

代码：

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int len = digits.size();
	if (len < 1)return digits;
	int temp = 1;
	for (int i = len - 1; i >= 0; i--) {
		int t = digits[i] + temp;
		temp = t / 10;
		digits[i] = t % 10;
	}
	if (temp > 0) {
		digits.push_back(temp);
		for (int i = len - 1; i >= 0; i--) {
			digits[i + 1] = digits[i];
		}
		digits[0] = temp;
	}
	return digits;
    }
};

想法：

不要粗心，分清条件情况