mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
1227haran 2024-10-02 23:37:07 +05:30 committed by GitHub
parent 00e9d86224
commit 918fa8bb8a
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/linked_list/has_loop.py
View File

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