Plus One

Plus One 

Given a non-negative number represented as an array of digits, plus one to the number.

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) {
            digits[digits.length - 1] += 1;
            for(int i = digits.length - 1; i >=0 ; i--){
                if((digits[i] / 10) == 1 && i != 0){//有进位
                    digits[i] = digits[i] % 10;
                    digits[i - 1] += 1;//向高位进1
                }
            }
            if(digits[0] / 10 == 0)
                return digits;
            else{
                int result[] = new int[digits.length + 1];
                System.arraycopy(digits, 0, result, 1, digits.length);
                result[0] = 1;
                result[1] %= 10;
                return result;
            }
       }
}