Skip to content
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 - Julia Bouvier #21

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 18 additions & 3 deletions lib/max_subarray.rb
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,22 @@
# Time Complexity: ?
# Space Complexity: ?
def max_sub_array(nums)
Comment on lines 2 to 4

Choose a reason for hiding this comment

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

This works, but no guesses as to time/space complexity?

return 0 if nums == nil

raise NotImplementedError, "Method not implemented yet!"
return 0 if nums == nil
return nil if nums.empty?

max_so_far = max_ending_here = nums[0]

nums[1..-1].each do |num|
if num > max_ending_here + num
max_ending_here = num
else
max_ending_here += num
end

if max_so_far < max_ending_here
max_so_far = max_ending_here
end
end

return max_so_far
end
20 changes: 17 additions & 3 deletions lib/newman_conway.rb
Original file line number Diff line number Diff line change
@@ -1,7 +1,21 @@


# Time complexity: ?
# Space Complexity: ?
# Time complexity: O(n)
# Space Complexity: O(n)
def newman_conway(num)
Comment on lines +3 to 5

Choose a reason for hiding this comment

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

👍 Nicely done

raise NotImplementedError, "newman_conway isn't implemented"
raise ArgumentError if num < 1

storage = []

i = 1
while i <= num
if i < 3
storage[i] = 1
else
storage[i] = storage[storage[i - 1]] + storage[i - storage[i - 1]]
end
i += 1
end

return storage.join(" ")[1..-1] # fencepost slice
end
2 changes: 1 addition & 1 deletion test/max_sub_array_test.rb
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
require_relative "test_helper"

xdescribe "max subarray" do
describe "max subarray" do
it "will work for [-2,1,-3,4,-1,2,1,-5,4]" do
# Arrange
input = [-2,1,-3,4,-1,2,1,-5,4]
Expand Down