plusone

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]&＃43;&＃43;;int i;for( i&＃61;digits.length-1; i>0 && digits[i]/10 !&＃61; 0; i-- ){digits[i-1] &＃43;&＃61; digits[i]/10;digits[i] &＃61; digits[i] % 10;}int[] res &＃61; null;int k; //the start point of res to copy from digitsif( digits[i]/10!&＃61;0 ){res &＃61; new int[ digits.length &＃43; 1 ];res[0] &＃61; digits[i] / 10;digits[i] &＃61; digits[i] % 10;k &＃61; 1;}else{res &＃61; new int[ digits.length ];k &＃61; 0;}System.arraycopy(digits, 0, res, k, digits.length);return res;}
}