【leetcode】#142. Linked List Cycle II - 环形链表 II - 寻找环入口

以前练过的题，emm，还是不太熟

题目

leetcode
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
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.

Notice that you should not modify the linked list.

函数

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode *detectCycle(struct ListNode *head) {
}

分析

实现

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode *detectCycle(struct ListNode *head) {
    struct ListNode *fast,*slow;
    fast = head;
    slow = head;
    while (fast && fast->next){
    	fast = fast->next->next;
    	slow = slow->next;
    	if (fast == slow){
    		fast = head;
    		while(fast != slow){
    			fast = fast->next;
    			slow = slow->next;
    		}
    		return slow;
    	}
    }
    return NULL;
}