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) {
        // 使用快慢指针 如果快指针追到慢指针（相遇）就代表有环
        ListNode fast = head;
        ListNode slow = head;

        while (fast != null && fast.next != null) {  // 首结点不为空并且存在下一个结点
            fast = fast.next.next;
            slow = slow.next;

            if (slow == fast) {  // 如果相遇
                return true;
            }
        }
        return false;
    }
}