题目:
Given head, the head of a linked list, determine if the linked list has a cycle in it.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected to. Note that pos is not passed as a parameter.
Return true if there is a cycle in the linked list. Otherwise, return false.
思路:这道题题意很简单,主要利用好节点数<= 10^4就很好解决了。
直接上代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
const int max = 10001;
bool hasCycle(ListNode *head) {
auto count = 0;
while(count++ < max and head != nullptr)
{
head = head->next;
}
if(count < max)return false;
else return true;
}
};