FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_121/LeetCode_141_121.java at master · isnotnull/algorithm · GitHub
isnotnull
/
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_121
/
LeetCode_141_121.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
42 lines (38 loc) · 868 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_121
/
LeetCode_141_121.java
Copy path
File metadata and controls
42 lines (38 loc) · 868 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
40
41
42
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public
class
Solution
{
public
ListNode
detectCycle
(
ListNode
head
) {
ListNode
fast
=
head
;
ListNode
slow
=
head
;
ListNode
meet
=
null
;
while
(
fast
!=
null
){
fast
=
fast
.
next
;
slow
=
slow
.
next
;
if
(
fast
==
null
){
return
null
;
}
fast
=
fast
.
next
;
if
(
fast
==
slow
){
meet
=
fast
;
break
;
}
}
while
(
meet
!=
null
&&
head
!=
null
){
if
(
meet
==
head
){
return
meet
;
}
meet
=
meet
.
next
;
head
=
head
.
next
;
}
return
null
;
}
}
Back
|
FazBrowse Home
|
New Git URL