算法--双指针的用法

1.环形链表

public boolean hasCycle(ListNode head) {
        //快慢指针
        ListNode fast , slow;
        fast = slow = head;

        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
            if(fast == slow){
                return true;
            }
        }
        return false;
    }

1. 判断链表是否有环形--链表中环的入口节点

public class Solution {
    public ListNode detectCycle(ListNode head) {
        //快慢指针
        ListNode fast = head, slow = head;
        while (true) {
            //判断是否有环
            if (fast == null || fast.next == null) return null;
            fast = fast.next.next;
            slow = slow.next;
            //有环跳出
            if (fast == slow) break;
        }
        fast = head;
        while (slow != fast) {
            slow = slow.next;
            fast = fast.next;
        }
        return fast;
    }
}