leetCode-Plus One

Description:
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.

Solution:

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

leetCode-Plus One

原文：http://www.cnblogs.com/kevincong/p/7900332.html