【leetcode】66. Plus One

最新推荐文章于 2024-04-27 23:40:23 发布

artemisrj

最新推荐文章于 2024-04-27 23:40:23 发布

阅读量393

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/artemisrj/article/details/51923693

版权

leetcode 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

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) {
        int size = digits.size();
        int loc = size -1;
        int added = 1;
        while(added&&loc>=0){
            if(digits[loc]<9){
                digits[loc] += added;
                added = 0;
            }else{
                digits[loc] = 0;
                loc--;
            }
        }
        if(added){
            digits.insert(digits.begin(),added);
        }
        return digits;
    }
};