首页 > itarticle > leetcode练习

leetcode练习

admin 11月 14, 2020 0

问题链接:Linked List Cycle

最先想到的是遍历链表, 并将结点的内存地址存在HashSet中.如果当前结点的内存地址已经存在,则表示存在环,直接返回true.


 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class  {
    public boolean hasCycle(ListNode head) {
        if (head == null || head.next == null) {
            return false;
        }
        Set<ListNode> set = new HashSet<>();
        while (head != null) {
            if (set.contains(head)) {
                return true;
            }else {
                set.add(head);
            }
            head = head.next;
        }
        return false;
    }
}

时间复杂度O(n)

空间复杂度O(n)

后来看了解析, 原来还有快慢指针的解法

public class  {
    public boolean hasCycle(ListNode head) {
        if (head == null || head.next == null) {
            return false;
        }
        ListNode slow = head;
        ListNode fast = head.next;
        while (slow != fast) {
            if (fast == null || fast.next == null) {
                return false;
            }
            slow = slow.next;
            fast = fast.next.next;
        }
        return true;
    }
}