2.两数相加

2020/10/7

# Heading

    2.两数相加 (opens new window)
    Tags: algorithms adobe airbnb amazon bloomberg microsoft linked-list math

    Langs: c cpp csharp golang java javascript kotlin php python python3 ruby rust scala swift typescript

    • algorithms
    • Medium (38.18%)
    • Likes: 4926
    • Dislikes: -
    • Total Accepted: 555.7K
    • Total Submissions: 1.5M
    • Testcase Example: '[2,4,3]\n[5,6,4]'

    给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。

    如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。

    您可以假设除了数字 0 之外,这两个数都不会以 0 开头。

    示例:

    输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
    输出:7 -> 0 -> 8
    原因:342 + 465 = 807
    
    1
    2
    3
    /*
     * @lc app=leetcode.cn id=2 lang=javascript
     *
     * [2] 两数相加
     */
    
    // @lc code=start
    /**
     * Definition for singly-linked list.
     * function ListNode(val, next) {
     *     this.val = (val===undefined ? 0 : val)
     *     this.next = (next===undefined ? null : next)
     * }
     */
    function ListNode(val, next) {
        this.val = (val === undefined ? 0 : val)
        this.next = (next === undefined ? null : next)
    }
    /**
     * @param {ListNode} l1
     * @param {ListNode} l2
     * @return {ListNode}
     */
    var addTwoNumbers = function (l1, l2) {
        let l3 = null;
        let tag = 0, val, p;
    
        const dealTag = (val, tag) => {
            if (val > 9) {
                val -= 10
                tag = 1
            } else {
                tag = 0
            }
            return {
                val, tag
            }
        }
    
        while (l1 && l2) {
            ({ val, tag } = dealTag(l1.val + l2.val + tag, tag))
            if (l3) {
                p.next = new ListNode(val);
                p = p.next
            } else {
                l3 = new ListNode(val)
                p = l3
            }
            l1 = l1.next
            l2 = l2.next
        }
        while (l1) {
            ({ val, tag } = dealTag(l1.val + tag, tag))
            p.next = new ListNode(val);
            l1 = l1.next
            p = p.next
        }
        while (l2) {
            ({ val, tag } = dealTag(l2.val + tag, tag))
            p.next = new ListNode(val);
            l2 = l2.next
            p = p.next
        }
        if (tag === 1) {
            p.next = new ListNode(1);
        }
        return l3
    
    };
    // @lc code=end
    
    
    // @after-stub-for-debug-begin
    module.exports = addTwoNumbers;
    // @after-stub-for-debug-end
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67
    68
    69
    70
    71
    72
    73
    74