leetcode - Plus One

最新推荐文章于 2024-11-11 20:59:17 发布

miao65272156

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量321

点赞数

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

本文链接：https://blog.csdn.net/miao65272156/article/details/31774269

版权

leetcode 专栏收录该内容

109 篇文章 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.

分析：先将结果逆序存在stack里，再存到返回结果里

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        int n = digits.size();
        vector<int> ret;
        if(n == 0)return ret;
        stack<int> a;
        int b = 1;
        for(int i = n-1; i > -1; i--)
        {
            int m = digits[i]+b;
            if(m == 10)
            {
                a.push(0);
                b = 1;
            }
            else
            {
                a.push(m);
                b = 0;
            }
        }
        if(b == 1)a.push(1);
        int s = a.size();
        for(int i = 0; i < s; i++)
        {
            ret.push_back(a.top());
            a.pop();
        }
        return ret;
    }
};