LeetCode 솔루션

[Easy - wk6 - Q3] 141. Linked List Cycle

Chloe 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.06.07 01:08

6,543 조회
3 댓글
0 추천
0 비추천
목록 게시글 쓰기

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

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.

Return true if there is a cycle in the linked list. Otherwise, return false.

Example 1:

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

Example 2:

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

Example 3:

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

Constraints:

The number of the nodes in the list is in the range [0, 104].
-105 <= Node.val <= 105
pos is -1 or a valid index in the linked-list.

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

#leetcode, #easy, #문제풀이, #amazon, #spotify, #microsoft, #google, #goldman sachs, #oracle

익명
작성일 2022.06.08 20:24

class Solution:
def hasCycle(self, head: Optional[ListNode]) -> bool:
nodes = set()
node = head
while node:
if node in nodes:
return True
nodes.add(node)
node = node.next

return False

익명
작성일 2022.06.10 15:49

141. Linked List Cycle
Runtime: 90 ms, faster than 32.19% of Python3 online submissions for Linked List Cycle.
Memory Usage: 17.7 MB, less than 29.61% of Python3 online submissions for Linked List Cycle.

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def hasCycle(self, head: Optional[ListNode]) -> bool:
        slow, fast = head, head
        
        while fast and fast.next:
            fast = fast.next.next
            slow = slow.next
            if fast == slow: return True
        
        return False

익명
작성일 2022.06.10 18:09

public class Solution {
    public boolean hasCycle(ListNode head) {
        ListNode dummy = new ListNode();
        dummy.next = head;
        
        Set<ListNode> isVisited = new HashSet<>();
        while(dummy.next != null){
            if(isVisited.contains(dummy.next)){
                return true;
            }
            isVisited.add(dummy.next);
            dummy = dummy.next;
        }
        
        return false;
        
    }
}