Repository navigation
Expand file tree
/
Copy pathMergeTwoLists.java
More file actions
99 lines (86 loc) · 2.43 KB
/
Copy pathMergeTwoLists.java
File metadata and controls
99 lines (86 loc) · 2.43 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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/*
* Solution to problem: https://leetcode.com/problems/merge-two-sorted-lists/description/
*/
class ListNode{
int val;
ListNode next;
public ListNode(int val){this.val = val;}
}
public class MergeTwoLists {
public static ListNode merge(ListNode l1, ListNode l2){
ListNode merge = null;
if(l1==null && l2==null){
return null;
}else if(l1!=null && l2==null){
return l1;
}else if(l1==null && l2!=null){
return l2;
}else{
ListNode lptr1 = l1;
ListNode lptr2 = l2;
ListNode mptr = null;
if(lptr1.val <= lptr2.val){
merge = new ListNode(lptr1.val);
lptr1 = lptr1.next;
}else {
merge = new ListNode(lptr2.val);
lptr2 = lptr2.next;
}
mptr = merge;
while(lptr1!=null && lptr2!=null){
if(lptr1.val<=lptr2.val){
merge.next = new ListNode(lptr1.val);
merge = merge.next;
merge.next = new ListNode(lptr2.val);
lptr1 = lptr1.next;
}else{
merge.next = new ListNode(lptr2.val);
merge = merge.next;
merge.next = new ListNode(lptr1.val);
lptr2 = lptr2.next;
}
}
if(lptr1!=null){
merge.next = lptr1;
}
if(lptr2!=null){
merge.next = lptr2;
}
return mptr;
}
}
public static void print(ListNode l1){
while(l1!=null){
System.out.print(l1.val+" ");
l1 = l1.next;
}
System.out.println();
}
public static void main(String[] args) {
ListNode l1 = new ListNode(1);
ListNode l2 = new ListNode(2);
ListNode l3 = new ListNode(4);
l2.next = l3;
l1.next = l2;
ListNode l4 = new ListNode(1);
ListNode l5 = new ListNode(3);
ListNode l6 = new ListNode(4);
l5.next = l6;
l4.next = l5;
ListNode merge = merge(l1, l4);
System.out.println("inputs:");
print(l1);
print(l4);
System.out.println("output:");
print(merge);
}
/**
* Expected output:
* inputs:
* 1 2 4
* 1 3 4
* output:
* 1 1 2 3 4 4
*
*/
}