LeetCode 66 - Plus One

来源：互联网发布：知乎注册不了为什么编辑：程序博客网时间：2024/06/05 10:13

Plus One

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.

My Code

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

Runtime: 600 ms

0 0