Plus One

Q.66 Plus One

/*
You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.

Increment the large integer by one and return the resulting array of digits.
*/

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