75-days-dsa-challenge

Ninja technique🥷 to ACE DSA Interviews.

View the Project on GitHub

66. Plus One (Easy)

Solution

Code

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