Given a linked list, determine if it has a cycle in it.
给定一个链表,判断它是否有环
Follow up:
Can you solve it without using extra space?
Solution:
Python
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def hasCycle(self, head):
"""
:type head: ListNode
:rtype: bool
"""
fast = head
slow = head
while fast and fast.next:
fast = fast.next.next
slow = slow.next
if fast == slow:
return True
return False
C++
/**
* 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 = head;
ListNode* slow = head;
while (fast && fast->next){
fast = fast->next->next;
slow = slow->next;
if (slow == fast){
return true;
}
}
return false;
}
};
其实这道题的代码很简单,关键在于理解这个代码的解法。
要求链表是否有环,需要设置两个指针,一个快指针fast一个慢指针slow,fast每次走两步,slow每次走一步,如果链表有环的话,fast和slow必然会在链表环上相遇,这个好比时钟的秒针和分针。并且通过证明可以知道fast和slow相遇的时,slow必然没有走完环的一圈(极限情况是slow刚好走完一圈到达环的入口处)。理解了这个原理之后就可以编写代码了。
这里有一篇博客详细介绍了链表环的各种情况:
https://www.cnblogs.com/dancingrain/p/3405197.html