Skip to content

142.环形链表-ii

环形链表

题解

js
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */

/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var detectCycle = function (head) {
  let fast = head;
  let slow = head;
  while (fast && fast.next) {
    fast = fast.next.next;
    slow = slow.next;
    // 快慢指针重合
    if (slow === fast) {
      // 从链表首节点开始
      let index1 = fast;
      // 从相交点开始
      let index2 = head;
      while (index1 !== index2) {
        index1 = index1.next;
        index2 = index2.next;
      }
      return index2;
    }
  }
  return null;
};
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */

/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var detectCycle = function (head) {
  let fast = head;
  let slow = head;
  while (fast && fast.next) {
    fast = fast.next.next;
    slow = slow.next;
    // 快慢指针重合
    if (slow === fast) {
      // 从链表首节点开始
      let index1 = fast;
      // 从相交点开始
      let index2 = head;
      while (index1 !== index2) {
        index1 = index1.next;
        index2 = index2.next;
      }
      return index2;
    }
  }
  return null;
};

参考

代码随想录