【leetcode】第66题 Plus One 题目+解析+JAVA代码

【题目】

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 int[] plusOne(int[] digits) {
        int n=digits.length;
        digits[n-1]+=1;
        for(int i=n-1;i>=0;i--){
            if(digits[i]==10&&i!=0){
                digits[i-1]+=1;
                digits[i]=0;
            }
            else if(digits[i]==10&&i==0){
                int[] newdigits = new int[n+1];
                newdigits[0]=1;
                newdigits[1]=0;
                for(int j=2;j<=n;j++){
                    newdigits[j]=digits[j-1];
                }
                return newdigits;
            } 
            else
                break;
        }
        return digits;
    }