-
Notifications
You must be signed in to change notification settings - Fork 133
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.
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
Some bugs #1
Comments
What is the bug for a list of size 1? I have tested inserting a single element and calling the .length() function and it returns 1 as it should. The assertion calls to .length() in .get and .erase are certainly inefficient but I hesitate to remove them because I would like to keep the code as similar to that taught in the video as possible. That being said, removing them won't cause any issues as long as the edge cases they protect against are caught inside the while loops. Thanks for the input! |
after the code I got This error
Can you help me with it? |
self.head=node() |
Your linked_list.lenght has a bug for list of size 1. Also, your get calls length which does an extra O(n) iteration just to check if index is valid.
The text was updated successfully, but these errors were encountered: