LeetCode 66. Plus One (Java)

题目：

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:
Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:
Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

解答：

这个题目的要点在于对加法进位的判断，从个位数开始，如果加一后等于10，那么就要进位，而进位时也要不断对高位进行判断是否还要进位。从最低位开始，如果不进位就直接返回，否则就按照要进位的方式去一遍遍循环。

class Solution {
    public int[] plusOne(int[] digits) {
        int c=1;
        for(int i=digits.length-1;i>=0;i--){
            if(digits[i]<9){
                digits[i]=digits[i]+c;
                return digits;
            } else{
                digits[i]=0;
            }
        }
        //若数组长度需要+1，则重新申请一个新数组，将数组的值移过去
        if(digits[0]==0){
            int[] newdigits=new int[digits.length+1];
            for(int i=0;i<newdigits.length;i++){
                newdigits[i+1]=digits[i];
                newdigits[0]=1;
                return newdigits;
            }
        } 
        return digits;
    }
}