双指针概览
1. 快慢指针常用算法
(1)判定链表中是否有环
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
bool hasCycle(ListNode* head)
{
ListNode* fast, slow;
fast = slow = head;
while ((fast != nullptr) && (fast->next != nullptr)) {
fast = fast->next->next;
slow = slow->next;
if (fast == slow) {
return true;
}
}
return fasle;
}
(2)已知链表中有环,返还这个环的起始位置