FilesExpand file tree

 main

/

LinkedListCycleDetection.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (27 loc) · 803 Bytes

 main

/

LinkedListCycleDetection.java

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (27 loc) · 803 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

/**

* Definition for singly-linked list.

* class ListNode {

* int val;

* ListNode next;

* ListNode(int x) {

* val = x;

* next = null;

* }

* }

*/

public class LinkedListCycleDetection {

public boolean hasCycle(ListNode head) {

// will use 2 pointer method fast and slow

ListNode fast = head;

ListNode slow = head;

while(fast != null && fast.next != null){

// increament fast with double speed of slow

fast = fast.next.next;

slow = slow.next;

// if both points to same node then return true as cycle is present in linked list

if(fast == slow) return true;

}

// if loop over and didn't returned true then no cycle return false

return false;

}

}