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 (36 loc) · 943 Bytes

File metadata and controls

38 lines (36 loc) · 943 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
/*
Author: King, higuige@gmail.com
Date: Oct 5, 2014
Problem: Linked List Cycle
Difficulty: Easy
Source: http://oj.leetcode.com/problems/linked-list-cycle/
Notes:
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
Solution: two pointers.
*/
/**
* 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, fast = head;
while (fast != null && fast.next != null) {
slow = slow.next;
fast = fast.next.next;
if (slow == fast) break;
}
if (fast == null || fast.next == null) return false;
return true;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.