LeetCode 66 : Plus One

问题描述

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

实现（Java）

class Solution {
    /*
    主要考虑两种情况：
    case1: {9} +1 ={1,0}  数组长度增加
    case2: {1,2} +1 ={ 1,3} 数组长度不变 最后+1
    case3: {1,9} +1 ={2,0}  {9,9}+1={1,0,0}   ...  数组长度不变 有进位
    */
    public static int[] plusOne(int[] digits) {

        int len = digits.length;
        for (int i = len - 1; i >= 0; i--) {
            if (digits[i] < 9) {
                //case2: {1,2} +1 ={ 1,3} 数组长度不变 最后+1  返回
                digits[i]++;
                return digits;
            }
            //case3: {1,9} +1 ={2,0}  数组长度不变 有进位
            // 最后一位变为0 i指向前一位 再次进入循环
            // digits[i]=1 < 9 digits[i]++变为2
            digits[i] = 0;
        }
        // case3: {1,9} +1 ={2,0}  {9,9}+1={1,0,0}   ...  数组长度不变 有进位
        // 在前面的for没有返回
        //new一个长度+1的数组 第一位为1 返回
        int[] result = new int[len + 1];
        result[0] = 1;
        return result;
    }
}