Skip to content

Abigail C - Rock#55

Open
ChaAbby wants to merge 1 commit intoAda-C15:masterfrom
ChaAbby:master
Open

Abigail C - Rock#55
ChaAbby wants to merge 1 commit intoAda-C15:masterfrom
ChaAbby:master

Conversation

@ChaAbby
Copy link
Copy Markdown

@ChaAbby ChaAbby commented Jan 13, 2022

No description provided.

Copy link
Copy Markdown

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Abigail, you hit the learning goals here. I left some minor feedback for you, but this was well done.

Comment on lines +22 to 24
# Time Complexity: O(1)
# Space Complexity: O(1)
def get_first(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +32 to 34
# Time Complexity: O(1)
# Space Complexity: O(1)
def add_first(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +35 to +36
new_node = Node(value, next_node=self.head)
self.head = new_node
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can be rewritten

Suggested change
new_node = Node(value, next_node=self.head)
self.head = new_node
self.head = Node(value, next_node=self.head)

Comment on lines +40 to 43
# Time Complexity: O(n)
# Space Complexity: O(1)

def search(self, value):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +53 to 56
# Time Complexity: O(n)
# Space Complexity: O(1)

def length(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +124 to +126
# Time Complexity: O(n)
# Space Complexity: O(1)
def delete(self, val):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +144 to 146
# Time Complexity: O(n)
# Space Complexity: O(n)
def visit(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +158 to 160
# Time Complexity: O(n)
# Space Complexity: O(1)
def reverse(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +174 to 176
# Time Complexity: O(n)
# Space Complexity: O(1)
def find_middle_value(self):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 This works, but you could either:

  • use the length method
  • or have a fast and slow node reference where the fast move 2 nodes with each iteration and the slow moves one. Then when the fast reaches the end, the slow is referring to the middle node.

# # assume indexing starts at 0 while counting to n
# # Time Complexity: O(n)
# # Space Complexity: O(1)
def find_nth_from_end(self, n):
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 this works with similar feedback to find middle.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants