【leetcode】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?

题目解读：判断一个链表是否存在环

思路：使用floyd判圈算法，设置一个跑的快的指针和一个跑的慢的指针，如果两个指针能相遇则存在环

c++代码（12ms）

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

代码简化一下如下：

public boolean hasCycle(ListNode head) {
        if(head==null) return false;
        ListNode walker = head;
        ListNode runner = head;
        while(runner.next!=null && runner.next.next!=null) {
            walker = walker.next;
            runner = runner.next.next;
            if(walker==runner) return true;
        }
        return false;
    }