Spruce - Michelle Morales #15
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
May 29, 2022
| self.size = 0 | ||
|
|
||
|
|
||
| def enqueue(self, element): |
|
|
||
| self.store[self.rear] = element | ||
| self.rear = (self.rear + 1) % self.buffer_size | ||
| self.size += 1 | ||
|
|
||
| def dequeue(self): |
| if self.front == self.rear: | ||
| self.front = -1 | ||
| self.rear = -1 | ||
| return value | ||
|
|
||
| def front(self): |
| @@ -13,49 +13,78 @@ def __init__(self): | |||
| self.store = [None] * INITIAL_QUEUE_SIZE | |||
| self.buffer_size = INITIAL_QUEUE_SIZE | |||
| self.front = -1 | |||
| self.rear = -1 | |||
| self.rear = 0 | |||
There was a problem hiding this comment.
There's not really anything wrong with initializing this to 0, but since you reset it to '-1' in dequeue below when the queue becomes empty, it's best to stay consistent across the board.
Suggested change
| self.rear = 0 | |
| self.rear = -1 |
Comment on lines
+65
to
+67
| if self.front == -1: | ||
| return 0 | ||
| return self.size |
There was a problem hiding this comment.
Since size should already be 0 if the queue is empty, you can probably delete lines 65 - 66.
Suggested change
| if self.front == -1: | |
| return 0 | |
| return self.size | |
| return self.size |
| for x in range(size): | ||
| result.append(self.store[index]) | ||
| index = (index + 1) % self.buffer_size | ||
| size -= 1 |
There was a problem hiding this comment.
We generally try not to change the value we are iterating through, and it's not necessary to modify size here.
Suggested change
| size -= 1 |
| @@ -12,7 +12,7 @@ def push(self, element): | |||
| """ Adds an element to the top of the Stack. | |||
| Returns None | |||
| """ | |||
| pass | |||
| self.store.add_first(element) | |||
| @@ -21,18 +21,18 @@ def pop(self): | |||
| The Stack is empty. | |||
| returns None | |||
| """ | |||
| pass | |||
| return self.store.remove_first() | |||
|
|
||
| def empty(self): | ||
| """ Returns True if the Stack is empty | ||
| And False otherwise | ||
| """ | ||
| pass | ||
| return self.store.empty() |
|
|
||
| def __str__(self): | ||
| """ Returns the Stack in String form like: | ||
| [3, 4, 7] | ||
| Starting with the top of the Stack and | ||
| ending with the bottom of the Stack. | ||
| """ | ||
| pass | ||
| return str(self.store) |
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.
Stacks and Queues
Thanks for doing some brain yoga. You are now submitting this assignment!
Comprehension Questions
OPTIONAL JobSimulation