-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path合并两个排序的链表.js
48 lines (47 loc) · 1005 Bytes
/
合并两个排序的链表.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
题目描述:
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
*/
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
function Merge(pHead1, pHead2)
{
if(!pHead1 && !pHead2){
return false;
}
if(!pHead1 && pHead2){
return pHead2;
}
if(pHead1 && !pHead2){
return pHead1;
}
let head;
if(pHead1.val <= pHead2.val) {
head = pHead1;
pHead1 = pHead1.next;
}else {
head = pHead2;
pHead2 = pHead2.next;
}
let p = head;
while(pHead1 && pHead2){
if(pHead1.val <= pHead2.val){
p.next = pHead1;
pHead1 = pHead1.next;
p = p.next;
}else{
p.next = pHead2;
pHead2 = pHead2.next;
p = p.next;
}
}
if(pHead1){
p.next = pHead1;
}
if(pHead2){
p.next = pHead2;
}
return head;
}