-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
141.java
56 lines (56 loc) · 1.49 KB
/
141.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
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
ListNode slow = head,fast = head;
while(slow!=null&&fast!=null&&fast.next!=null){
slow = slow.next;
fast = fast.next.next;
if(slow == fast)
return true;
}
return false;
}
}
__________________________________________________________________________________________________
sample 34996 kb submission
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
if (head == null || head.next == null) {
return false;
}
ListNode slow = head;
ListNode fast = head.next;
while(slow != null && fast != null) {
if (slow == fast) {
return true;
}
slow = slow.next;
fast = fast.next != null ? fast.next.next : null;
}
return false;
}
}
__________________________________________________________________________________________________