https://leetcode-cn.com/problems/linked-list-cycle-ii/
上面漏了两个字,“只要res与slow” --> “只要res与slow相遇”
代码如下:
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var detectCycle = function(head) {
if(!head) return null;
let slow = head, fast = head;
while(true) {
if(fast && fast.next) fast = fast.next.next;
else return null;
slow = slow.next;
if(slow === fast) break;
}
let res = head;
while(res!==slow) {
slow = slow.next;
res = res.next;
}
return res;
};