牛客网：BM6 判断链表中是否有环

import java.util.HashSet;
import java.util.Map;

/**
 * @author xienl
 * @description 判断链表中是否有环
 * @date 2022/6/7
 */

public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();

    }

    /**
     * 使用哈希表实现，时间复杂度是o(n), hash表，空间复杂度也是o(n)
     * @param head
     * @return
     */
    public boolean hasCycle(ListNode head) {
        HashSet<ListNode> map = new HashSet<>();
        while (head != null){
            if (map.contains(head)){
                return true;
            }
            map.add(head);
            head = head.next;
        }
        return false;
    }

    /**
     * 使用双指针
     * @param head
     * @return
     */
    public boolean hasCycle2(ListNode head) {
        if (head == null){
            return false;
        }

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

  class ListNode {
      int val;
      ListNode next;
      ListNode(int x) {
          val = x;
          next = null;
      }
  }