LeetCode ----- Plus One

最新推荐文章于 2022-04-07 11:40:00 发布

原创最新推荐文章于 2022-04-07 11:40:00 发布 · 152 阅读

0 ·

CC 4.0 BY-SA版权

题目专栏收录该内容

52 篇文章

订阅专栏

本文介绍了一种针对非空数组表示的非负整数进行加一操作的算法实现。该算法考虑了进位处理及边界情况，如数组最高位为9时的处理方式，并通过示例展示了输入输出的变化。

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.

    public int[] plusOne(int[] digits) {
        int len = digits.length - 1;
        digits[len] ++;
        int[] ret = new int[digits.length+1];
        int carry = 0;
        while (carry != 0 || (len == -1 && carry == 1) || (len > -1 && digits[len] % 10 == 0)) {
            if (len == -1 && carry == 1) {
                System.arraycopy(digits, 0, ret, 1, digits.length);
                ret[0] = 1;
                return ret;
            }
            digits[len] = digits[len] + carry;
            if (digits[len] / 10 == 1) {
                carry = 1;
                digits[len] = 0;
            } else {
                carry = 0;
            }
            len --;
        }

        return digits;
    }