FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

Update for remove_by_value in singly_linked_list_exercise.py by Inamul2 · Pull Request #51 · codebasics/data-structures-algorithms-python · GitHub

/ data-structures-algorithms-python Public

Update for remove_by_value in singly_linked_list_exercise.py #51

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

Open
Inamul2 wants to merge 1 commit into
base: master
Choose a base branch
Could not load branches
Branch not found: {{ refName }}

Are you sure you want to change the base?

Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
from
Conversation 0 Commits 1 Checks 0 Files changed
Open

Update for remove_by_value in singly_linked_list_exercise.py #51

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension .py  (1) All 1 file type selected
Viewed files
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Unified
Split
Hide whitespace
Diff view
Unified
Split
Hide whitespace
9 changes: 8 additions & 1 deletion data_structures/3_LinkedList/Solution/singly_linked_list_exercise.py
Show comments
View file
Open in desktop
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
Show hidden characters
Original file line number Diff line number Diff line change
Expand Up @@ -110,13 +110,20 @@ def remove_by_value(self, data):
if self.head.data == data:
self.head = self.head.next
return


initial_length = self.get_length()
count = 0
itr = self.head
while itr.next:
if itr.next.data == data:
itr.next = itr.next.next
break
itr = itr.next
count += 1

if count == initial_length:
raise Exception("The specified element is not present in the linked list")


if __name__ == '__main__':
ll = LinkedList()
Expand Down
Back | FazBrowse Home | New Git URL