首页 > 代码库 > Leetcode: Linked List Cycle
Leetcode: Linked List Cycle
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
分析:如果一个linked list中有环,那么在用一个快指针和一个慢指针遍历该linked list时,这两个指针必会相交。代码如下:
class Solution {public: bool hasCycle(ListNode *head) { if(head == NULL || head->next == NULL) return false; ListNode *fast = head, *slow = head; while(slow->next && fast->next && fast->next->next){ fast = fast->next->next; slow = slow->next; if(fast == slow) return true; } return false; }};
Leetcode: Linked List Cycle
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。