23_leetcode_plusOne

最新推荐文章于 2024-10-08 10:36:00 发布

ezzffzz

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量311

点赞数

分类专栏：编程算法 leetcode 文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/29353133

版权

编程同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

算法

155 篇文章 0 订阅

订阅专栏

leetcode

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

1:当数组为空时；2:注意进位；3数组中数字从前到后交换

  vector<int> plusOne(vector<int> &digits)
    {
        vector<int> result;
        if(digits.size() == 0)
        {
            result.push_back(1);
            return result;
        }
        
        //最低位在末尾
        int size = (int)digits.size();
        int count = 1;
        for(int i = size - 1; i >= 0; i--)
        {
            int temp = digits[i] + count;
            if(temp >= 10)
            {
                result.push_back(temp - 10);
                count = 1;
            }
            else
            {
                result.push_back(temp);
                count = 0;
            }
        }
        
        if(count == 1)
        {
            result.push_back(1);
        }
        
        size = (int)result.size();
        
        int start = 0;
        int end = size - 1;
        while(start < end)
        {
            swap(result[start++], result[end--]);
        }
        
        return result;
        
    }