-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprblm21.java
More file actions
81 lines (78 loc) · 2.34 KB
/
prblm21.java
File metadata and controls
81 lines (78 loc) · 2.34 KB
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
public class prblm21 {
public static void main(String[] args) {
//Self Made LinkedList to check the code
ListNode l11 = new ListNode(1);
ListNode l12 = new ListNode(2);
ListNode l13 = new ListNode(4);
ListNode head1 = l11;
l11.next = l12;
l12.next = l13;
ListNode l21 = new ListNode(1);
ListNode l22 = new ListNode(3);
ListNode l23 = new ListNode(4);
ListNode head2 = l21;
l21.next = l22;
l22.next = l23;
printNode(head1);
printNode(head2);
printNode(mergeTwoLists(head1, head2));
}
public static void printNode(ListNode head){
ListNode curr = head;
while (curr != null) {
System.out.print(curr.val + " ");
curr = curr.next;
}
System.out.println();
}
public static ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode curr1 = list1;
ListNode curr2 = list2;
ListNode list3 = null;
if(curr1 == null){
return curr2;
}
if(curr2 == null){
return curr1;
}
while (curr1 != null && curr2 != null) {
if(curr1.val == curr2.val){
list3 = addNode(list3,curr1.val);
list3 = addNode(list3,curr2.val);
curr1 = curr1.next;
curr2 = curr2.next;
}
else if (curr1.val < curr2.val) {
list3 = addNode(list3,curr1.val);
curr1 = curr1.next;
}
else if (curr1.val > curr2.val) {
list3 = addNode(list3,curr2.val);
curr2 = curr2.next;
}
}
while (curr1 != null) {
list3 = addNode(list3, curr1.val);
curr1 = curr1.next;
}
while (curr2 != null) {
list3 = addNode(list3, curr2.val);
curr2 = curr2.next;
}
return list3;
}
public static ListNode addNode(ListNode list3, int val){
ListNode node = new ListNode(val);
if(list3 == null){
list3 = node;
}
else{
ListNode ptr = list3;
while (ptr.next != null) {
ptr = ptr.next;
}
ptr.next = node;
}
return list3;
}
}