141. Linked List Cycle

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