-
Notifications
You must be signed in to change notification settings - Fork 46
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
Branches - Farah #33
base: master
Are you sure you want to change the base?
Branches - Farah #33
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You definitely have a feel for linked lists, but you have a few bugs here. Take a look at my comments and let me know if you have questions.
@@ -1,4 +1,5 @@ | |||
require_relative 'node' | |||
require 'pry' |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You can remove pry on submission
# Time complexity - ? | ||
# Space complexity - ? | ||
# Time complexity - O(1) where 1 is the one node created | ||
# Space complexity - O(1) where 1 is the one node created in space | ||
def add_first(data) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time complexity - O(1) where 1 is the one node created | ||
# Space complexity - O(1) where 1 is the one node created in space |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Actually it's O(1) because the amount of time and memory doesn't change no matter how big the list is.
# Time complexity - ? | ||
# Space complexity - ? | ||
# Time complexity - O(n) where n is the length of the list, in worst case scenario | ||
# Space complexity - O(1) because only single node data is returned | ||
def get_at_index(index) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What if the index is greater than the length of the list?
def get_last | ||
current = @head |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What if head
is nil
?
current = @head | |
return nil if head.nil? | |
current = head |
|
||
if current.nil? | ||
add_first(data) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Good re-use of a method
# Time complexity - ? | ||
# Space complexity - ? | ||
# Time complexity - O(n) where n is the length of the entire list | ||
# Space complexity - O(1) because you are adding one node | ||
def add_last(data) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time complexity - ? | ||
# Space complexity - ? | ||
# Time complexity - O(n) where n is the length of the linked list | ||
# Space complexity - O(1) because only a single number is being returning, the length of the list | ||
def length |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
Linked List Comprehension Questions