题目:
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
解释:
经典面试题,判断一个链表是否有环。
用快慢指针做,快指针一次走两个位置,慢指针一次走一个位置,如果慢指针追上了快指针,则证明链表和有环,因为如果链表没有环,那么快指针永远在慢指针前面。
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
"""
if not head:
return False
slow,fast=head,head
while fast and fast.next:
slow=slow.next
fast=fast.next.next
if slow is fast:
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) {
ListNode* fast=head;
ListNode* slow=head;
while(fast && fast->next)
{
slow=slow->next;
fast=fast->next->next;
if(slow==fast)
return true;
}
return false;
}
};
总结:
注意快慢指针的循环条件是while(fast && fast->next)
。