LeetCode Easy Plus One

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

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

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种针对非空数字数组表示的非负整数进行加一操作的算法实现。通过逆向遍历数组，逐位进行加一运算，并处理进位，实现了对整数的正确加一。在出现进位超出当前数组长度的情况下，算法会创建一个新的数组来存储结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Solution1

public class Solution1 {
    public int[] plusOne(int[] digits) {
        int carry = 1;
        for (int i = digits.length - 1; i >= 0; i--) {
            digits[i] = digits[i] + carry;
            carry = digits[i] / 10;
            digits[i] = digits[i] % 10;
        }
        if (carry > 0) {
            int[] newDigits = new int[digits.length + 1];
            newDigits[0] = carry;
            for (int i = 0; i < digits.length; i++) {
                newDigits[i + 1] = digits[i];
            }
            return newDigits;
        }
        return digits;
    }
}