Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
38 lines (33 loc) · 822 Bytes

File metadata and controls

38 lines (33 loc) · 822 Bytes
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
package LeetCode;
/**
* Given a linked list, determine if it has a cycle in it.
* Follow up:
* Can you solve it without using extra space?
* @author Administrator
*
*/
public class HasCycle {
public HasCycle() {
// TODO Auto-generated constructor stub
}
class ListNode {
int val;
ListNode next;
public ListNode(int val) {
this.val = val;
}
}
public boolean hasCycle(ListNode head) {
if (head == null) return false;
ListNode oneStep = head;
ListNode twoStep = head.next;
while (twoStep != null && twoStep.next != null) {
if (oneStep == twoStep) {
return true;
}
oneStep = oneStep.next;
twoStep = twoStep.next.next;
}
return false;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.