/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
if(head == NULL){
return NULL;
}
ListNode *fast = head;
ListNode *slow = head;
ListNode *meet = NULL, *p = head;
while(fast && fast->next){
slow = slow->next;
fast = fast->next->next;
if(slow == fast ){
slow = head;
while(fast != slow){
slow = slow->next;
fast = fast->next;
}
return slow;
}
}
return NULL;
}
};
142. Linked List Cycle II(两个指针)
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- 题目要求: Given a linked list, return the node where the cycl...
- Given a linked list, return the node where the cycle begi...
- Given a linked list, return the node where the cycle begi...
- Given a linked list, return the node where the cycle begi...