LeetCode 0066 - Plus One

Reck Zhang

发布于 2021-08-11 10:39:34

3720

发布于 2021-08-11 10:39:34

文章被收录于专栏：Reck Zhang

Plus One

Desicription

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.

Solution

class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {
        digits[digits.size()-1]++;
        for(int i = digits.size()-1; i > 0; i--)
            if(digits[i] >= 10)
                digits[i] -= 10, digits[i-1]++;
        if(digits[0] >= 10)
            digits[0] -= 10, digits.insert(digits.begin(), 1);
        return digits;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-17，如有侵权请联系 cloudcommunity@tencent.com 删除

digits