Java for LeetCode 066 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.

解題思路：

往一個用數組表示的數裡面加1，注意下資料溢出即可，JAVA實現如下：

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

 

Java for LeetCode 066 Plus One