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

Time - Hannah T #22

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
11 changes: 5 additions & 6 deletions Gemfile
Original file line number Diff line number Diff line change
@@ -1,10 +1,9 @@
# frozen_string_literal: true
source "https://rubygems.org"

gem 'rake'
gem 'minitest'
gem 'minitest-spec'
gem 'minitest-reporters'
gem "rake"
gem "minitest"
gem "minitest-spec"
gem "minitest-reporters"
gem "pry"
gem 'minitest-skip'

gem "minitest-skip"
4 changes: 2 additions & 2 deletions Rakefile
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
require 'rake/testtask'
require "rake/testtask"

Rake::TestTask.new do |t|
t.libs = ["lib"]
t.warning = true
t.test_files = FileList['test/*_test.rb']
t.test_files = FileList["test/*_test.rb"]
end

task default: :test
21 changes: 15 additions & 6 deletions lib/max_subarray.rb
Original file line number Diff line number Diff line change
@@ -1,8 +1,17 @@

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n)
# Space Complexity: O(1)
def max_sub_array(nums)
Comment on lines +1 to 3

Choose a reason for hiding this comment

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

👍

return 0 if nums == nil

raise NotImplementedError, "Method not implemented yet!"
max_so_far = max_ending_here = nums[0]
for i in 1..nums.length - 1
# puts nums[i]
puts max_ending_here
max_ending_here = max_ending_here + nums[i]
if max_ending_here < nums[i]
max_ending_here = nums[i]
end
if max_so_far < max_ending_here
max_so_far = max_ending_here
end
end
return max_so_far
end
40 changes: 35 additions & 5 deletions lib/newman_conway.rb
Original file line number Diff line number Diff line change
@@ -1,7 +1,37 @@
# Time complexity: O(n)
# Space Complexity: O(n)


# Time complexity: ?
# Space Complexity: ?
def newman_conway(num)
Comment on lines +1 to 4

Choose a reason for hiding this comment

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

👍

raise NotImplementedError, "newman_conway isn't implemented"
end
raise ArgumentError if num <= 0
return "1" if num == 1

cached_array = [1, 1, 1]

for i in 3..num
current = cached_array[cached_array[i - 1]] + cached_array[i - (cached_array[i - 1])]
cached_array[i] = current
end
cached_array.delete_at(0)
return cached_array.join(" ")
end






# def newman_conway(num)
# raise ArgumentError if num <= 0
# return "1" if num == 1

# cached_array = [0, 1, 1]
# i = 3
# until i >= num + 1
# current = cached_array[cached_array[i - 1]] + cached_array[i - (cached_array[i - 1])]

# cached_array[i] = current
# i += 1
# end
# cached_array.delete_at(0)
# return cached_array.join(' ')
# 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
51 changes: 25 additions & 26 deletions test/newman_conway_test.rb
Original file line number Diff line number Diff line change
Expand Up @@ -24,31 +24,30 @@
end

it "works with base cases" do
# Arrange
input = 0

# Act-Assert
expect {
newman_conway(input)
}.must_raise ArgumentError


# Arrange
input = 1

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1"

# Arrange
input = 2

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1 1"
# Arrange
input = 0

# Act-Assert
expect {
newman_conway(input)
}.must_raise ArgumentError

# Arrange
input = 1

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1"

# Arrange
input = 2

# Act
answer = newman_conway(input)

# Assert
expect(answer).must_equal "1 1"
end
end
9 changes: 4 additions & 5 deletions test/test_helper.rb
Original file line number Diff line number Diff line change
@@ -1,10 +1,9 @@

require 'minitest'
require 'minitest/autorun'
require 'minitest/reporters'
require "minitest"
require "minitest/autorun"
require "minitest/reporters"
require "minitest/skip_dsl"

Minitest::Reporters.use! Minitest::Reporters::SpecReporter.new

require_relative "../lib/newman_conway"
require_relative "../lib/max_subarray"
require_relative "../lib/max_subarray"