8000 Contains loops.py add by kanthuc · Pull Request #2442 · TheAlgorithms/Python · GitHub
[go: up one dir, main page]
Skip to content

Contains loops.py add #2442

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Sep 18, 2020
Merged

Contains loops.py add #2442

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
3a3a9fc
Merge pull request #1 from TheAlgorithms/master
kanthuc Sep 16, 2020
378e932
added an algorithm which checks a linked list for loops and returns t…
kanthuc Sep 16, 2020
d37fd6e
added doctests and clarified meaning of loop
kanthuc Sep 18, 2020
92578b0
Define Node.__iter__()
cclauss Sep 18, 2020
519f71a
Update and rename has_loop.py to has_duplicate_data.py
cclauss Sep 18, 2020
444b3ce
Update has_duplicate_data.py
cclauss Sep 18, 2020
cbd04a6
Update has_duplicate_data.py
cclauss Sep 18, 2020
448091d
Update and rename has_duplicate_data.py to has_loop.py
cclauss Sep 18, 2020
9a41f51
Update has_loop.py
cclauss Sep 18, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update has_duplicate_data.py
  • Loading branch information
@cclauss
cclauss authored Sep 18, 2020
commit 444b3cec89295d233d18c5925b49e2f3fff309ec
1 change: 1 addition & 0 deletions data_structures/linked_list/has_duplicate_data.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ def __iter__(self):

@property
def has_duplicate_data(self) -> bool:
"""
>>> node1 = Node(1)
>>> node1.next_node = Node(2)
>>> node1.next_node.next_node = Node(3)
Expand Down
0