-
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
Leaves - Mariya #39
base: master
Are you sure you want to change the base?
Leaves - Mariya #39
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change | ||||||
---|---|---|---|---|---|---|---|---|
|
@@ -10,36 +10,70 @@ def initialize | |||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def add_first(data) | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 👍 |
||||||||
|
||||||||
@head = Node.new(data, @head) | ||||||||
end | ||||||||
|
||||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def get_first | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 👍 |
||||||||
|
||||||||
if @head.nil? | ||||||||
return nil | ||||||||
else | ||||||||
return @head.data | ||||||||
end | ||||||||
end | ||||||||
|
||||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def length | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 👍 |
||||||||
return 0 | ||||||||
count = 0 | ||||||||
temp = @head | ||||||||
while temp != nil | ||||||||
count += 1 | ||||||||
temp = temp.next | ||||||||
end | ||||||||
return count | ||||||||
end | ||||||||
|
||||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def add_last(data) | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 👍 |
||||||||
new_node = Node.new(data) | ||||||||
|
||||||||
if @head.nil? | ||||||||
@head = new_node | ||||||||
else | ||||||||
current = @head | ||||||||
until current.next.nil? | ||||||||
current = current.next | ||||||||
end | ||||||||
current.next = new_node | ||||||||
end | ||||||||
end | ||||||||
|
||||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def get_last | ||||||||
|
||||||||
current = @head | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. What if
Suggested change
|
||||||||
until current.next.nil? | ||||||||
current = current.next | ||||||||
end | ||||||||
return current.data | ||||||||
end | ||||||||
|
||||||||
# Time complexity - ? | ||||||||
# Space complexity - ? | ||||||||
def get_at_index(index) | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. What about if the index is greater than the length of the list? |
||||||||
current = @head | ||||||||
if current.nil? | ||||||||
return nil | ||||||||
end | ||||||||
|
||||||||
index.times do | ||||||||
current = current.next | ||||||||
end | ||||||||
|
||||||||
return current.data | ||||||||
end | ||||||||
|
||||||||
end |
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.
Nothing on any space/time complexity????