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:

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

---

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

• 地址

问题分析

• 解法一： 按照加法运算的顺序，从低位开始带进位相加。
• 解法二：按照加1的特性，找从右边起第一个非9的元素，如果要是 + 1的话，那么因为该元素右边都是9，进位后都变成了0，而该位置则因为进位 + 1。
  但是，要注意 [9,9,9]这种情况，这种情况直接返回 [1,0,0,0]即可

代码实现

class Solution {
    public int[] plusOne(int[] digits) {
        if (digits == null || digits.length == 0) {
            return digits;
        }
        int i = digits.length - 1;
        while (i >= 0 && digits[i] == 9){
            --i;
        }
        if (i == -1) {
            int[] res = new int[digits.length + 1];
            res[0] = 1;
            return res;
        }
        ++digits[i++];
        while (i < digits.length) {
            digits[i++] = 0;
        }
        return digits;
    }
}