leetcode: Plus One

最新推荐文章于 2022-03-01 10:50:00 发布

原创最新推荐文章于 2022-03-01 10:50:00 发布 · 348 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一种在数字以数组形式存储的情况下，对该数字加一的算法实现。该算法通过遍历数组并处理进位来完成加一操作，并确保结果仍以数组形式返回。

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

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.

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