LeetCode Plus One

 1 public class Solution {
 2     public int[] plusOne(int[] digits) {
 3         if(digits == null || digits.length == 0){
 4             return digits;
 5         }
 6         int carry = 1;
 7         for(int i = digits.length-1; i>=0; i--){
 8             int cur = (digits[i]+carry)%10;
 9             carry = (digits[i]+carry)/10;
10             digits[i] = cur;
11             
12             if(carry == 0){
13                 return digits;
14             }
15         }
16         
17         int [] newDigits = new int[digits.length+1];
18         newDigits[0] = 1;
19         return newDigits;
20     }
21 }