141. Linked List Cycle(快慢指针的典型应用)

problems:
Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

tips:
判断链表是否有环.参考 http://www.cnblogs.com/wuyuegb2312/p/3183214.html 帮助理解.
使用快慢指针求解,有两个指针p1和p2,开始时两个指针都指向链表的表头,每次p1向前走一步即p1=p1->next,p2向前走两步即p2=p2->next->next,用相对运动的观点来看,相当于每次p1静止,p2相对于p1每次向前走一步,二者在顺时针方向上的距离每经过一次就减少1,直至为0,也即二者刚好相遇.若无环,则结束条件是p2后继为空.
solutions:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    bool hasCycle(ListNode *head) {
        if(head == NULL) return false;
        if(head->next == NULL) return false;
        if(head->next->next == NULL) return false;
        
        ListNode *pFast = head;
        ListNode *pSlow = head;
        while(pFast != NULL && pFast->next != NULL)
        {
            pSlow = pSlow->next;//慢指针每次移动一个位置
            pFast = pFast->next->next;//快指针每次移动两个位置
            if(pSlow == pFast) return true;
        }
        return false;
    }
};