题目:
给定一个链表的头节点 head ,返回链表开始入环的第一个节点。 如果链表无环,则返回 null。
C++:
思路:
两快慢指针,快指针前进两步,慢指针前进一步,当二者相遇,说明存在环;
注意:此时相遇处不一定为链表环的入口。
然后令快指针指向head,快慢指针步长为1向前走,第二次相遇时,即为链表环的入口。
具体思路:
https://leetcode.cn/problems/linked-list-cycle-ii/?envType=study-plan-v2&envId=top-100-liked
#include<iostream>
using namespace std;
struct ListNode
{
int val;
ListNode *next;
ListNode(int x)
{
val = x;
next = nullptr;
}
ListNode(int x, ListNode *next)
{
val = x;
next = next;
}
};
class Solution
{
public:
ListNode *returncyclehead(ListNode *head)
{
ListNode* fast = head;
ListNode* slow = head;
while (true)
{
if (fast == nullptr || fast->next == nullptr) return nullptr;
fast = fast->next->next;
slow = slow->next;
if (fast == slow) break;
}
fast = head;
while (fast != slow)
{
fast = fast->next;
slow = slow->next;
}
return fast;
}
};
python:
思路:同上
class ListNode(object):
def __init__(self,x):
self.val = x
self.next = None
class Solution(object):
def returncyclehead(self,head):
fast, slow = head, head
while True:
if not (fast and fast.next): return
fast,slow = fast.next.next,slow.next
if fast == slow: break
fast ==head
while fast != slow:
fast, slow = fast.next, slow.next
return fast