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.

Code in JAVA:

public static int[] plusOne(int[] digits) {
   int carry = 0; 
   int i = digits.length - 1;
   digits[i] += 1;
   while (digits[i] >= 10) {
     digits[i--] -= 10;
     if (i >= 0) {
      digits[i] += 1;
     } else {
       carry = 1;
       break;
     }
  }
  if (carry == 0) {return digits;}

  int[] result = new int[digits.length + 1];
  for (i = 0; i < digits.length; i++) {
     result[i + 1] = digits[i];
  }
  result[0] = 1;
  return result;
}