题目描述
输入两个递增的链表,单个链表的长度为n,合并这两个链表并使新链表中的节点仍然是递增排序的。
数据范围: 0≤n≤1000,-1000≤节点值≤1000
要求:空间复杂度 O(1),时间复杂度O(n)
示例:如输入{1,3,5},{2,4,6}时,合并后的链表为{1,2,3,4,5,6},所以对应的输出为{1,2,3,4,5,6},
题解
function ListNode(x){
this.val = x;
this.next = null;
}
function Merge(pHead1, pHead2)
{
if(!pHead1) return pHead2;
if(!pHead2) return pHead1;
var newList = new ListNode(-1);
var cur = newList;
while(pHead1 && pHead2) {
if(pHead1.val <= pHead2.val){
cur.next= pHead1;
pHead1 = pHead1.next;
} else {
cur.next= pHead2;
pHead2 = pHead2.next;
}
cur = cur.next;
}
if(pHead1) cur.next = pHead1;
if(pHead2) cur.next = pHead2;
return newList.next;
}
module.exports = {
Merge : Merge
};