Data-Structures-and-Algorithms/CPP/Problems/Leetcode-141-linked-list-cycle.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/Problems/Leetcode-141-linked-list-cycle.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.8 (1638 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/**
 * Definition for singly-linked list.
 * struct ListNode {
 * int val;
 * ListNode *next;
 * ListNode(int x) : val(x), next(NULL) {}
 * };
*/
classSolution {
public:
boolhasCycle(ListNode *head) {
 ListNode *slow=head, *fast=head;
while(fast!=NULL && fast->next!=NULL){
 slow=slow->next;
 fast=fast->next->next;
if(fast==slow)
returntrue;
 }
returnfalse;
 }
};