-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
21.java
166 lines (158 loc) · 4.22 KB
/
21.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
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
__________________________________________________________________________________________________
0ms
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null) return l2;
if(l2 == null) return l1;
if(l1.val < l2.val){
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else{
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}
}
__________________________________________________________________________________________________
1ms
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
ListNode temp1 = new ListNode(0);
ListNode result = new ListNode(0);
ListNode head = new ListNode(0);
int count = 0;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
temp1 = l1;
l1 = l1.next;
} else {
temp1 = l2;
l2 = l2.next;
}
if (count == 0) {
head = temp1;
}
result.next = temp1;
result = result.next;
count++;
}
if (l1 == null) {
result.next = l2;
}
if (l2 == null) {
result.next = l1;
}
return head;
}
}
__________________________________________________________________________________________________
2ms
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1==null && l2==null) return null;
if(l1==null) return l2;
if(l2==null) return l1;
List<Integer> list = new ArrayList<>();
ListNode curr = l1;
while(curr!=null){
list.add(curr.val);
curr = curr.next;
}
curr = l2;
while(curr!=null){
list.add(curr.val);
curr = curr.next;
}
Collections.sort(list);
Iterator<Integer> it = list.iterator();
ListNode head = new ListNode(it.next());
curr = head;
while(it.hasNext()){
curr.next = new ListNode(it.next());
curr = curr.next;
}
return head;
}
}
__________________________________________________________________________________________________
35292 kb
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null) return l2;
if(l2 == null) return l1;
if(l1.val < l2.val){
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else{
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}
}
__________________________________________________________________________________________________
35296 kb
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode dummyHead = dummy;
while(l1 != null || l2 != null) {
if(l1 != null && l2 == null || l1 != null && l2 != null && (l1.val <= l2.val)){
dummy.next = l1;
l1 = l1.next;
dummy = dummy.next;
}else {
dummy.next = l2;
l2 = l2.next;
dummy = dummy.next;
}
}
return dummyHead.next;
}
}
__________________________________________________________________________________________________