leetcode7 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.

解：

package leetcode;

//将数组存储在数组中+1,如果相应的数字位为9置为0，假如最高位仍是9则补一位1
public class leetcode7 {
public int[] plusOne(int[] digits) {
       for(int i=digits.length-1;i>=0;i--)
       {
        if(digits[i]!=9)
        {
        digits[i]=digits[i]+1;
        return digits; //如果高位不是9直接加1
        }
        else
        digits[i]=0; //是9则为0
       }
       int [] res=new int[digits.length+1]; //如果最高位是9则多加一位1
       res[0]=1;
       return res;
   }
}