[LeetCode]21. 合并两个有序链表 —— javascript

21. 合并两个有序链表
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

	var mergeTwoLists = function (l1, l2) {
	    var lHead = new ListNode(0);
	    var lCur = lHead;
	    while (l1 !== null && l2 !== null) {
	        if(l1.val < l2.val) {
	            lCur.next = l1;
	            lCur = lCur.next;
	            l1 = l1.next;
	        } else {
	            lCur.next = l2;
	            lCur = lCur.next;
	            l2 = l2.next; 
	        }
	    }
	    if (l1 === null) {
	        lCur.next = l2;
	    } 
	    if (l2 === null) {
	        lCur.next = l1;
	    }
	    return lHead.next;
	};