-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeTwoSortedList.java
52 lines (37 loc) · 1.42 KB
/
MergeTwoSortedList.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
public class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
//Creating a temporary head node for us to start traversing from
ListNode tempNode = new ListNode(0);
ListNode currentNode = tempNode;
//Make sure the two head nodes for both lists are working
while(list1 != null && list2 != null){
//Comparing the values for each item in both nodes and append them to the
//list as the condition dictates
if(list1.val < list2.val){
currentNode.next = list1;
list1 = list1.next;
}else {
currentNode.next = list2;
list2 = list2.next;
}
currentNode = currentNode.next;
}
//In case if one list is longer than the other, one will reach null before
//the other.
//These checks are for that:
if(list1 != null){
currentNode.next = list1;
list1 = list1.next;
}
if(list2 != null){
currentNode.next = list2;
list2 = list2.next;
}
return tempNode.next;
}