66. Plus One

 

 

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.

 

 

 

 

public class Solution {
    public int[] plusOne(int[] digits) {
         int c=1;
        int n=digits.length;
        for (int i=n-1;i>=0;i--){
            digits[i]+=c;
            if(digits[i]<10)
                return digits;
            else {
                digits[i]=0;
            }
        }
        int[] res=new int[n+1];
        res[0]=1;
        return res;
    }
}