力扣算法05——环形链表

 代码实现：

import java.util.HashSet;
import java.util.Set;

/**
 * 创建节点
 */
class ListNode{
    int val;
    ListNode next;
    public ListNode(int val,ListNode next){
        this.val = val;
        this.next = next;
    }
}

public class LinkCycle {
    public static void main(String[] args) {
        ListNode node5 = new ListNode(5,null);
        ListNode node4 = new ListNode(4, node5);
        ListNode node3 = new ListNode(3, node4);
        ListNode node2 = new ListNode(2, node3);
        ListNode node1 = new ListNode(1, node2);
        node5.next = node1;

        System.out.println(hasCycle(node1));
        System.out.println(hasCycle1(node1));
    }
//使用set集合特点结合遍历
    public static boolean hasCycle(ListNode head){
        Set<ListNode> set = new HashSet<>();
        while (head != null){
            if (!set.add(head)){
                return true;
            }
            head = head.next;
        }
        return false;
    }
//双指针法在空间上比上一种小但是时间一样
    public static boolean hasCycle1(ListNode head){
        if (head == null || head.next == null){
            return false;
        }
        ListNode slow = head;
        ListNode quick = head.next;
        while (slow != quick){
            if (quick == null||quick.next == null){
                return false;
            }
            slow = slow.next;
            //走两步
            quick = quick.next.next;
        }
        return true;
    }
}