2. Add Two Numbers
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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.
题意：两个链表值相加，返回链表节点拼接成数字的翻转值
代码如下
var addTwoNumbers = function(l1, l2) { let dummy = new ListNode(-1); let cur = dummy; let carry = 0; // 确保两个链表都遍历完成 while (l1 || l2) { let d1 = l1 ? l1.val : 0; let d2 = l2 ? l2.val : 0; let sum = d1 + d2 + carry; // 两个节点的值相加后考虑有进位的情况 carry = sum >= 10 ? 1 : 0; cur.next = new ListNode(sum % 10); cur = cur.next; if (l1 ) l1 = l1.next; if (l2 ) l2 = l2.next; } if (carry == 1) cur.next = new ListNode(1); return dummy.next; };
原文：https://www.cnblogs.com/xingguozhiming/p/10372288.html