[leetcode] 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.

• 1 2 3 4 5 6 7 8 9 10 11 12 13 14

  public int[] plusOne(int[] digits) { for (int i = digits.length - 1; i >= 0; i--) { if (digits[i] == 9) { digits[i] = 0; } else { digits[i] += 1; return digits; } } int[] a = new int[digits.length + 1]; a[0] = 1; return a; }