Maple - Rhyannon Rodriguez #72
Open
Conversation
This file contains 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
kyra-patton
reviewed
Jul 28, 2022
| @@ -13,83 +12,161 @@ def __init__(self): | |||
|
|
|||
| # returns the value in the first node | |||
| # returns None if the list is empty | |||
| # Time Complexity: ? | |||
| # Space Complexity: ? | |||
| # Time Complexity: Linear O(N), size of LL | |||
There was a problem hiding this comment.
⏱ Time complexity would actually be O(1) here, because you only ever need to look at the head of the list.
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Adding a head, Constant O(1) | ||
| # Space Complexity: Constant O(1) not creating new data structure | ||
| def add_first(self, value): |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), size of the LL | ||
| # Space Complexity: Constant O(1), we're not creating data structures | ||
| def search(self, value): |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), size of the LL | ||
| # Space Complexity: Constant O(1), we're not creating data structures | ||
| def length(self): |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), size of the LL | ||
| # Space Complexity: Constant O(1), we're not creating data structures | ||
| def get_at_index(self, index): |
| current = self.head | ||
| while current.next: | ||
| current = current.next | ||
| current.next = new_node | ||
|
|
||
| # method to return the max value in the linked list | ||
| # returns the data value and not the node | ||
| def find_max(self): |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), size of the LL | ||
| # Space Complexity: Constant O(1), we're not creating data structures | ||
| def delete(self, value): |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), size of the LL | ||
| # Space Complexity: Linear O(N), depending on the size of the visited_list | ||
| def visit(self): |
| def visit(self): | ||
| helper_list = [] | ||
| visited_list = [] | ||
| current = self.head | ||
|
|
||
| while current: |
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: Linear O(N), depending on the size of the LL | ||
| # Space Complexity: Constant O(1), no creation of new data structures | ||
| def reverse(self): |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Only required exercises completed