-
Notifications
You must be signed in to change notification settings - Fork 1
/
Merge two sorted linked list.java
63 lines (59 loc) · 1.16 KB
/
Merge two sorted linked list.java
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
class Node {
Node next;
int val;
Node(int val) {
this.val = val;
next = null;
}
}
*/
/*
below function is used to insert nodes in the linked list
public static Node insert111(Node head, int val) {
if(head == null) {
return new Node(val);
} else {
Node cur;
cur = insert111(head.next, val);
head.next = cur;
return head;
}
}
*/
static Node h3, e3;
public static Node insertEnd(int val){
if(h3 == null){
h3 = new Node(val);
e3 = h3;
}
else{
Node newnode = new Node(val);
e3.next = newnode;
e3 = e3.next;
}
return h3;
}
public static Node Merge (Node h1, Node h2){
h3 = null;
e3 = null;
while(h1!=null && h2!=null){
if(h1.val <= h2.val){
h3 = insertEnd(h1.val);
h1 = h1.next;
}
else{
h3 = insertEnd(h2.val);
h2 = h2.next;
}
}
while(h1 != null){
h3 = insertEnd(h1.val);
h1 = h1.next;
}
while(h2 != null){
h3 = insertEnd(h2.val);
h2 = h2.next;
}
return h3;
}