leetcode 66. Plus One

最新推荐文章于 2023-12-27 14:14:06 发布

liqinzhe223

最新推荐文章于 2023-12-27 14:14:06 发布

阅读量107

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/liqinzhe11/article/details/78579639

版权

leetcode 专栏收录该内容

280 篇文章 0 订阅

订阅专栏

66. Plus One

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