LeetCode:Linked List Cycle

最新推荐文章于 2019-12-25 06:42:34 发布

walker lee

最新推荐文章于 2019-12-25 06:42:34 发布

阅读量644

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Linked List Cycle

本文链接：https://blog.csdn.net/itismelzp/article/details/50063267

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

Linked List Cycle

Total Accepted: 96475 Total Submissions: 261646 Difficulty: Medium

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

Follow up:
Can you solve it without using extra space?

Subscribe to see which companies asked this question

Hide Tags

Linked List Two Pointers

Hide Similar Problems

(M) Linked List Cycle II

思路：

使用一个快指针fast和一个慢指针slow，快指针的速度是慢指针的2倍。

如果fast指针能追上慢指针slow，还代表有环存在。

因为两个指针的速度相差1，所以有环的话一定可以追上。

code:

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