2.（两个单链表加法运算）ADD TWO Numbers

最新推荐文章于 2022-02-07 11:10:58 发布

原创最新推荐文章于 2022-02-07 11:10:58 发布 · 222 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，该算法接收两个非空链表作为输入，这两个链表分别表示两个非负整数。通过将这些链表以逆序方式存储的数字相加，并处理进位，最终返回一个新的链表表示相加后的结果。

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

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

Output: 7 -> 0 -> 8

即：342+465=807 直接从左边到右边依次把两单链表相加，注意进位。

-------------------------JAVA-----------------------------------------

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode dummyHead = new ListNode(0);
    ListNode p = l1, q = l2, curr = dummyHead;
    int carry = 0;
    while (p != null || q != null) {
        int x = (p != null) ? p.val : 0;       //节点存在，则为节点值；节点为空，则置为0
        int y = (q != null) ? q.val : 0;
        int sum = carry + x + y;               //两数相加，且加上低位的进位
        carry = sum / 10;                     //进位
        curr.next = new ListNode(sum % 10);
        curr = curr.next;
        if (p != null) p = p.next;
        if (q != null) q = q.next;
    }
    if (carry > 0) {
        curr.next = new ListNode(carry);        //最高位
    }
    return dummyHead.next;
}

——————————————————————————————（ C++ ）————————————————————

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
    ListNode preHead(0), *p = &preHead;
    int extra = 0;
    while (l1 || l2 || extra) {
        int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + extra;
        extra = sum / 10;
        p->next = new ListNode(sum % 10);
        p = p->next;
        l1 = l1 ? l1->next : l1;
        l2 = l2 ? l2->next : l2;
    }
    return preHead.next;
}

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode c1 = l1;
        ListNode c2 = l2;
        ListNode sentinel = new ListNode(0);
        ListNode d = sentinel;
        int sum = 0;
        while (c1 != null || c2 != null) {
            sum /= 10;
            if (c1 != null) {
                sum += c1.val;
                c1 = c1.next;
            }
            if (c2 != null) {
                sum += c2.val;
                c2 = c2.next;
            }
            d.next = new ListNode(sum % 10);
            d = d.next;
        }
        if (sum / 10 == 1)
            d.next = new ListNode(1);
        return sentinel.next;
    }
}

　　2017-11-12 22:04:27更新