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

Heather #9

Open
wants to merge 3 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
24 changes: 19 additions & 5 deletions lib/max_subarray.rb
Original file line number Diff line number Diff line change
@@ -1,8 +1,22 @@

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(1), where n is the number of elements in the array

Choose a reason for hiding this comment

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

Constant? Really? No this is O(n) time complexity.

# Space Complexity: O(1)
def max_sub_array(nums)
return 0 if nums == nil

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

max = nums[0]
max_here = 0

nums.each do |num|
max_here += num
if max_here > max
max = max_here
end

if max_here < 0
max_here = 0
end
end

return max
end
35 changes: 31 additions & 4 deletions lib/newman_conway.rb
Original file line number Diff line number Diff line change
@@ -1,7 +1,34 @@


# Time complexity: ?
# Space Complexity: ?
# Time complexity: O(n), where n is approx. equal to num
# Space Complexity: O(n), where n is approx. equal to num for the series array & series_string
def newman_conway(num)
raise NotImplementedError, "newman_conway isn't implemented"
end
if num == 0
raise ArgumentError, "Num cannot be zero"
end

p1 = 1
p2 = 1
counter = 2

series = [0, p1, p2]
series_string = ""

if num < 2
series[1..num].each do |num|
series_string += "#{num} "
end
else
until counter == num
counter += 1
p_next = series[series[counter - 1]] + series[counter - series[counter - 1]]
series << p_next
end

series[1..-1].each do |num|
series_string += "#{num} "
end
end
Comment on lines +17 to +31

Choose a reason for hiding this comment

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

This definitely works, but could be simplified a bit. I don't think you need the if statement if already have the series array set up.


return series_string.strip
end
21 changes: 10 additions & 11 deletions test/max_sub_array_test.rb
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
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]
input = [-2, 1, -3, 4, -1, 2, 1, -5, 4]

# Act
answer = max_sub_array(input)
Expand All @@ -25,7 +25,7 @@

it "will work with a totally negative array with the largest element at the rear" do
# Arrange
input = [ -4, -5, -6, -7, -3]
input = [-4, -5, -6, -7, -3]

# Act
answer = max_sub_array(input)
Expand All @@ -46,14 +46,14 @@
end

it "will return nil for an empty array" do
# Arrange
input = []
# Arrange
input = []

# Act
answer = max_sub_array(input)
# Act
answer = max_sub_array(input)

# Assert
expect(answer).must_be_nil
# Assert
expect(answer).must_be_nil
end

it "will work for [50, -50, 50]" do
Expand All @@ -66,5 +66,4 @@
# Assert
expect(answer).must_equal 50
end

end
end