Add Two Numbers

最新推荐文章于 2024-05-07 14:18:04 发布

原创最新推荐文章于 2024-05-07 14:18:04 发布 · 317 阅读

0 ·

CC 4.0 BY-SA版权

刷遍数专栏收录该内容

260 篇文章

订阅专栏

本文介绍了一种解决两数相加问题的方法，通过链表节点存储数值，并逐位相加进位处理。该算法适用于需要进行大数运算且内存资源有限的场景。

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

一定要小心，不能互相影响

// carry = (num + carry)/10;
// num = (num + carry)%10;
            int res = num + carry;
            carry = res/10;
            num = res%10;

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode dummyNode = new ListNode(0);
        int carry = 0;
        boolean first = true;
        ListNode node = null;
        while (l1 != null || l2 != null || carry != 0) {
            int num = 0;
            if (l1 != null) {
                num = num + l1.val;
                l1 = l1.next;
            }
            if (l2 != null) {
                num = num + l2.val;
                l2 = l2.next;
            }
            // carry = (num + carry)/10;
            // num = (num + carry)%10;
            int res = num + carry;
            carry = res/10;
            num = res%10;
            ListNode newNode = new ListNode(num);
            if (first) {
                dummyNode.next = newNode;
                node = newNode;
                first = false;
            } else {
                node.next = newNode;
                node = node.next;
            }
        }
        return dummyNode.next;
    }