leetcode -- Plus One

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

public class Solution {
    public int[] plusOne(int[] digits) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int len = digits.length;
        digits[len - 1] += 1;
        int carry = 0;
        for(int i = len - 1; i >= 0; i --){
            digits[i] += carry;
10             carry = 0;
            if(digits[i] >= 10){
                carry = digits[i] / 10;
                digits[i] %= 10;
            }
        }
        if(carry > 0){
            int[] result = new int[len + 1];
            result[0] = carry;
            for(int i = 0; i < len; i++){
                result[i + 1] = digits[i];
            }
            return result;
        } else {
            return digits;
        }
    }
}

carry加完后需重置为0，因为后面只会有进位的时候才会重新计算carry