/**
* Definition for singly-linked list.
* 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) {
if (l1.val == 0 && l1.next === null) return l2
if (l2.val == 0 && l2.next === null) return l1
var advance0 = advance1 = 0;
var head = new ListNode(0);
let ptr = head;
while(l1 || l2){
sum = l1.val + l2.val + advance0;//advance0上一次进位
advance1 = parseInt(sum/10);
ptr.val = (l1.val + l2.val + advance0)%10;//advance1下一次进位
if (l1.next === null && l2.next === null && advance1 != 1) return head;
if (l1.next === null) l1.next = new ListNode(0);
if (l2.next === null) l2.next = new ListNode(0);
ptr = ptr.next = new ListNode();
advance0 = advance1;
l1 = l1.next;
l2 = l2.next;
}
};
力扣刷题记录【2. 两数相加】【js】
最新推荐文章于 2023-02-11 11:43:43 发布