LeetCode 141. Linked List Cycle

最新推荐文章于 2020-10-24 21:55:08 发布

wuqingdeqing

最新推荐文章于 2020-10-24 21:55:08 发布

阅读量175

点赞数

分类专栏：算法学习笔记文章标签： LeetCode 算法刷题

本文链接：https://blog.csdn.net/wuqingdeqing/article/details/103431941

版权

算法学习笔记专栏收录该内容

50 篇文章 0 订阅

订阅专栏

Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Input: head = [3,2,0,-4], pos = 1
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the second node.

Example 2:

Input: head = [1,2], pos = 0
Output: true
Explanation: There is a cycle in the linked list, where tail connects to the first node.

Example 3:

Input: head = [1], pos = -1
Output: false
Explanation: There is no cycle in the linked list.

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

队列中找环，其实只管想法就是把它逐个放入Set或者List里去，然后用contains方法，但其后续想降低空间复杂度，便想到经典的双指针走法，Accepted代码如下：

/**
 * 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 p1 = head;
        ListNode p2 = head;
        while (p2 != null && p2.next != null) {
            p1 = p1.next;
            p2 = p2.next.next;
            if (p1.equals(p2)) {
                return true;
            }
        }
        return false;
    }
}

该方法时间和空间复杂度均能超过当前100%的答案