题目:http://oj.leetcode.com/problems/linked-list-cycle-ii/
Given a linked list, return the node where the cycle begins. If there is no cycle, return null
.
Follow up:
Can you solve it without using extra space?
题目翻译:
给定一个链表,返回环开始的节点。如果没有环,则返回null。
进阶:
你可以不使用额外的空间解决它吗?
分析:
使用快慢指针。若链表存在环,两指针必在环中相遇,此时将慢指针移回头结点,两指针以相同的速度移动,在环开始的节点处再次相遇。(证明略)
C++实现:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *detectCycle(ListNode *head) {
if(head == NULL)
{
return NULL;
}
ListNode *fast = head;
ListNode *slow = head;
while(fast->next != NULL)
{
fast = fast->next->next;
if(fast == NULL)
{
return NULL;
}
slow = slow->next;
if(fast == slow)
{
slow = head;
while(fast != slow)
{
fast = fast->next;
slow = slow->next;
}
return fast;
}
}
return NULL;
}
};
Java实现:
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode detectCycle(ListNode head) {
if (head == null) {
return null;
}
ListNode fast = head;
ListNode slow = head;
while (fast.next != null) {
fast = fast.next.next;
if (fast == null) {
return null;
}
slow = slow.next;
if (fast == slow) {
slow = head;
while (fast != slow) {
fast = fast.next;
slow = slow.next;
}
return fast;
}
}
return null;
}
}
Python实现:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @param head, a ListNode
# @return a list node
def detectCycle(self, head):
if head == None:
return None
fast = head
slow = head
while fast.next != None:
fast = fast.next.next
if fast == None:
return None
slow = slow.next
if fast == slow:
slow = head
while fast != slow:
fast = fast.next
slow = slow.next
return fast
return None
感谢阅读,欢迎评论!