141. 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?

---

方法1：要求空间复杂度为O(1),建立快慢指针，如果两指针相遇说明有环

/**
 * 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||head->next==NULL)return false;
        ListNode *fast=head->next->next,*low=head;
        while(fast!=NULL&&fast->next!=NULL&&fast!=low){
            fast=fast->next->next;
            low=low->next;
        }
        if(fast==NULL||fast->next==NULL) return false;
        else return true;
    }
};

方法2：此外还可以做记号(会改变原链表)，set记录地址(额外空间)