LeetCode 66 - Plus One

最新推荐文章于 2021-06-12 23:22:06 发布

原创最新推荐文章于 2021-06-12 23:22:06 发布 · 611 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #LeetCode

编程题目专栏收录该内容

78 篇文章

订阅专栏

本文介绍了一个关于非负数加一的问题，该数以数组形式给出。文章详细展示了如何通过遍历数组并逐位处理进位来实现加一操作。特别关注了边界条件处理，例如当最高位产生进位时如何扩展数组。

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

Plus One

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.

My Code

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        int carry = 0, number = 0, size = digits.size(), i = size - 1;
        number = digits[i];
        number++;
        if (number == 10)
        {
            digits[i] = 0;
            carry = 1;
        }
        else
            digits[size - 1] = number;
        i--; 
        for (; carry && i >= 0; i--)
        {
            number = digits[i];
            number++;
            if (number == 10)
            {
                digits[i] = 0;
                carry = 1;
            }
            else
            {
                digits[i] = number;
                carry = 0;
            }
        }
        if (i == -1 && carry)
        {
            digits = vector<int>(size + 1);
            digits[0] = 1;
        }
        return digits;
    }
};

Runtime: 600 ms