LeetCode2 两数相加 &《程序员面试金典》面试题 02.05. 链表求和

题目

注意这边有两个问题：[简单版] 和 [进阶版]

解法

简单版解法

// javascript
var addTwoNumbers = function(l1, l2) {
   
    let sum = 0, carry = 0;
    let ResNode = new ListNode(0);
    const ResHead = ResNode;
    while (l1 !== null || l2 !== null || carry !== 0) {
    // 注意carry
        sum = carry;
        if (l1 !== null) {
   
            sum += l1.val;
            l1 = l1.next;
        }
        if (l2 !== null) {
   
            sum += l2.val;
            l2 = l2.next;
        }
        carry = (sum >= 10) ? 1 : 0;
        ResNode.next = new ListNode(sum % 10);
        ResNode =