LeetCode 989. Add to Array-Form of Integer

最新推荐文章于 2023-02-25 23:03:36 发布

katrina95

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量360

点赞数

分类专栏：计算机算法

本文链接：https://blog.youkuaiyun.com/katrina95/article/details/89206758

版权

计算机算法专栏收录该内容

221 篇文章

订阅专栏

本文介绍了一种算法，用于将一个非负整数的数组形式与另一个整数相加，并返回结果的数组形式。通过示例展示了如何处理进位，确保结果正确。

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

For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [1,2,3,1].

Given the array-form A of a non-negative integer X, return the array-form of the integer X+K.

Example 1:

Input: A = [1,2,0,0], K = 34
Output: [1,2,3,4]
Explanation: 1200 + 34 = 1234

Example 2:

Input: A = [2,7,4], K = 181
Output: [4,5,5]
Explanation: 274 + 181 = 455

Example 3:

Input: A = [2,1,5], K = 806
Output: [1,0,2,1]
Explanation: 215 + 806 = 1021

Example 4:

Input: A = [9,9,9,9,9,9,9,9,9,9], K = 1
Output: [1,0,0,0,0,0,0,0,0,0,0]
Explanation: 9999999999 + 1 = 10000000000

Note：

1 <= A.length <= 10000
0 <= A[i] <= 9
0 <= K <= 10000
If A.length > 1, then A[0] != 0

    public List<Integer> addToArrayForm(int[] a, int k) {
        List<Integer> res = new ArrayList<>();
        int h = 0;
        int index = a.length - 1;
        while (k > 0 && index >= 0) {
            int sum = a[index--] + k % 10 + h;
            res.add(0, sum % 10);
            h = sum / 10;
            k = k / 10;
        }
        while (k > 0) {
            int sum = k % 10 + h;
            res.add(0, sum % 10);
            h = sum / 10;
            k = k / 10;
        }
        while (index >= 0) {
            int sum = h + a[index--];
            res.add(0, sum % 10);
            h = sum / 10;
        }
        if (h == 1) {
            res.add(0, 1);
        }
        return res;
    }