[leetcode note] Linked List Cycle

时间: 2019-12-13 11:54 PM
题目地址: https://leetcode.com/problems/linked-list-cycle/

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.

给定一个链表，确定其中是否有循环。
为了表示给定链表中的循环，我们使用整数pos来表示尾部连接到链表中的位置（0索引）。 如果pos为-1，则链接列表中没有循环。

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.

Solution:

public boolean hasCycle(ListNode head) {
    if (null == head) {
        return false;
    }
    ListNode one = head;
    ListNode two = head.next;
    while (null != one && null != two && null != two.next) {
        if (one == two) {
            return true;
        }
        one = one.next;
        two = two.next.next;
    }
    return false;
}

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

欢迎关注公众号(代码如诗):