（Java）leetcode-141 Linked List Cycle

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了（Java）leetcode-141 Linked List Cycle，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1827字，纯文字阅读大概需要3分钟。

内容图文

题目

【判断链表是否有环】

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?

思路

设置一快一慢两个指针，快的一次走两步，慢的一次走一步，若链表中存在环，则两个指针必定会相遇，否则不存在环
时间复杂度 O(n）
空间复杂度 O(1)

代码1

 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        if(head == null) return false;
        ListNode fast = head;
        ListNode slow = head;
        while(  fast != null && fast.next != null ){
        	fast = fast.next.next;
        	slow = slow.next;
        	if(fast == slow) return true;

        }
        return false;

    }
}

提交结果

Runtime: 0 ms, faster than 100.00% of Java online submissions for Linked List Cycle.
Memory Usage: 38.7 MB, less than 29.76% of Java online submissions for Linked List Cycle.

代码2

答案的解法，思路一样

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;
}

提交结果

Runtime: 0 ms, faster than 100.00% of Java online submissions for Linked List Cycle.
Memory Usage: 38.5 MB, less than 54.54% of Java online submissions for Linked List Cycle.

内容总结

以上是互联网集市为您收集整理的（Java）leetcode-141 Linked List Cycle全部内容，希望文章能够帮你解决（Java）leetcode-141 Linked List Cycle所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端