Leetcode Plus One

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

feng_blog6688

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

阅读量292

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/jiangyingfeng/article/details/45766915

版权

leetcode 专栏收录该内容

56 篇文章 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，返回结果：9+1 = 10；

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        vector<int> result;
        int addbit = 0;
        int one;
        
        for(int i=digits.size()-1;i>=0;i--)
        {
            if(i==digits.size()-1)
                one = 1;
            else
                one = 0;
            if(digits[i]+one+addbit==10)
            {
                addbit = 1;
                result.push_back(0);
            }
            else
            {
                result.push_back(digits[i]+addbit+one);
                addbit = 0;
            }
        }
        if(addbit == 1)
            result.push_back(1);
        for(int j=0; j<result.size()/2;j++)
        {
            int temp = result[j];
            result[j] = result[result.size()-1-j];
            result[result.size()-1-j] = temp;
        }
        return result;
    }
};