bool hasCycle(struct ListNode *head) {
if (head == NULL) {
return false;
}
struct ListNode* fast, *slow;
fast = slow = head;
while (fast!= NULL && fast->next != NULL) {
slow = slow->next;
fast = fast->next->next;
if (fast == slow) {
return true;
}
}
return false;
}
判断链表中是否有环
最新推荐文章于 2021-06-15 19:21:35 发布