-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeTwoLists.java
64 lines (47 loc) · 1.32 KB
/
MergeTwoLists.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
64
public class MergeTwoLists {
public static ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode head = new ListNode(0);
ListNode currentPos = head;
while (list1 != null && list2 != null) {
if (list2.val <= list1.val ) {
currentPos.next = list2;
list2 = list2.next;
}
else {
currentPos.next = list1;
list1 = list1.next;
}
currentPos = currentPos.next;
}
if (list1 == null)
currentPos.next = list2;
if (list2 == null)
currentPos.next = list1;
return head.next;
}
public static void main(String args[]) {
ListNode list1 = new ListNode();
ListNode a = new ListNode();
ListNode b = new ListNode();
list1.val = 1;
list1.next = a;
a.val = 2;
a.next = b;
b.val = 4;
b.next = null;
ListNode list2 = new ListNode();
ListNode d = new ListNode();
ListNode e = new ListNode();
list2.val = 1;
list2.next = d;
d.val = 3;
d.next = e;
e.val = 5;
e.next = null;
ListNode sortedNodes = mergeTwoLists(list1, list2);
while (sortedNodes != null) {
System.out.println(sortedNodes.val);
sortedNodes = sortedNodes.next;
}
}
}