Optimized O(n) to O(1) (#11669)

2024-10-02 11:07:07 -07:00
parent 00e9d86224
commit 918fa8bb8a
1 changed files with 2 additions and 2 deletions
@@ -14,11 +14,11 @@ class Node:

    def __iter__(self):
        node = self
-        visited = []
+        visited = set()
        while node:
            if node in visited:
                raise ContainsLoopError
-            visited.append(node)
+            visited.add(node)
            yield node.data
            node = node.next_node