[leetcode]141&&142 Linked List Cycle

思路参考

141题 判断有无环路

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        if(head==null||head.next==null) return false;
        
        ListNode slow = head;
        ListNode fast = head;
        
        // A fast pointer will either loop around a cycle and meet the slow
        // pointer or reach the `null` at the end of a non-cyclic list.
        while(fast!=null&&fast.next!=null){
            slow = slow.next;
            fast = fast.next.next;
            
            if(slow==fast){
                return true;
            }
        }
        
        return false;
        
    }
}

142题 找出环的起点

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode detectCycle(ListNode head) {
        if(head==null||head.next==null) return null;
        
        ListNode slow = head;
        ListNode fast = head;
        
        while(fast!=null&&fast.next!=null){
            slow=slow.next;
            fast=fast.next.next;
            if(slow==fast){
                break;
            }
        }
        //没有环的情况。如果fast到最后一个或者null了，还不等于slow，则没有环
        if(slow!=fast) return null;
        
        fast=head;
        while(fast!=slow){
            fast=fast.next;
            slow=slow.next;
        }
        return slow;
        
    }
}