FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_142/LeetCode_21_142.java at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_01
/
id_142
/
LeetCode_21_142.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
39 lines (38 loc) · 983 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_142
/
LeetCode_21_142.java
Copy path
File metadata and controls
39 lines (38 loc) · 983 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* 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
ret
=
null
;
ListNode
l
=
null
;
while
(
l1
!=
null
||
l2
!=
null
) {
ListNode
curr
;
if
(
l1
==
null
) {
curr
=
l2
;
l2
=
l2
.
next
;
}
else
if
(
l2
==
null
) {
curr
=
l1
;
l1
=
l1
.
next
;
}
else
if
(
l1
.
val
<=
l2
.
val
) {
curr
=
l1
;
l1
=
l1
.
next
;
}
else
{
curr
=
l2
;
l2
=
l2
.
next
;
}
if
(
ret
==
null
) {
ret
=
new
ListNode
(
curr
.
val
);
l
=
ret
;
}
else
{
l
.
next
=
new
ListNode
(
curr
.
val
);
l
=
l
.
next
;
}
}
return
ret
;
}
}
Back
|
FazBrowse Home
|
New Git URL