leetcode02-addTwoNumbers

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
function ListNode(val) {
     this.val = val;
     this.next = null;
}

var l1=new ListNode(9);
l1.next=new ListNode(9);
l1.next.next=new ListNode(9);

var l2=new ListNode(9);
l2.next=new ListNode(9);
l2.next.next=new ListNode(4);



var addTwoNumbers = function(l1, l2) {
    var dummyHead = new ListNode(0);
    var p = l1, q = l2, curr = dummyHead;
    var carry = 0;
    while (p !==null || q !== null) {
        var x = (p !== null) ? p.val : 0;
        var y = (q !== null) ? q.val : 0;
        var sum = carry + x + y;
        carry = parseInt(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;
};




var result=addTwoNumbers1(l1,l2);
console.log(result);

 

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章