leetcode-66 plus one

Yanxi1122

于 2017-04-12 10:39:18 发布

阅读量201

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/u010508340/article/details/70140176

Leetcode 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种针对非负整数（以数字数组形式表示）进行加一操作的算法实现。该算法从数组末尾开始逐位计算，并处理进位情况。特别地，文章考虑了不含有前导零的情况，除了数字0本身。通过具体代码示例展示了如何有效地解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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

The digits are stored such that the most significant digit is at the head of the list

这道题，从后向前依次加和，需要记录下进位，和处理最后的进位

class Solution 
{
public:
	vector<int> plusOne(vector<int>& digits) 
	{
		vector<int> res;
		vector<int> tempres;

		int jinwei=0;
		int n = digits.size();

		int num = digits[n-1] + 1;
		if (num >= 10)
		{
			jinwei = 1;
			tempres.push_back(num-10);

			for (int i = n - 2; i >= 0; i--)
			{
				num = jinwei + digits[i];
				if (num >= 10)
				{
					tempres.push_back(num - 10);
					jinwei = 1;
				}
				else
				{
					tempres.push_back(num);
					jinwei = 0;
				}
			}
		}
		else
		{
			jinwei = 0;
			tempres.push_back(num);
			for (int i = n - 2; i >= 0; i--)
			{
				num = jinwei + digits[i];
				if (num >= 10)
				{
					tempres.push_back(num - 10);
					jinwei = 1;
				}
				else
				{
					tempres.push_back(num);
					jinwei = 0;
				}
			}
		}
		
		if (jinwei == 1)
			tempres.push_back(1);

		for (int i = tempres.size() - 1; i >= 0; i--)
		{
			res.push_back(tempres[i]);
		}

		return res;
	}
};