Leaves - Dominique

lib/max_subarray.rb

@@ -1,8 +1,19 @@
 
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: O(n)
+# Space Complexity: O(1)
 def max_sub_array(nums)
     return 0 if nums == nil
 
-    raise NotImplementedError, "Method not implemented yet!"
+    current_max = nums[0]
+    global_max = nums[0]
+
+    i = 1
+
+    while i < nums.length 
+        current_max = [nums[i], (current_max + nums[i])].max
+        global_max = [global_max, current_max].max
+        i += 1
+    end 
+
+    return global_max
 end

lib/newman_conway.rb

@@ -1,7 +1,30 @@
 
 
-# Time complexity: ?
-# Space Complexity: ?
+# Time complexity: O(n)
+# Space Complexity: O(1)
 def newman_conway(num)
-  raise NotImplementedError, "newman_conway isn't implemented"
-end
+  raise ArgumentError, "num must be >= 0" if num <= 0
+  return "1" if num == 1
+  return "1 1" if num == 2
+
+  array = Array.new(num + 1){}
+
+  # Build a memo of subproblems
+
+  array[1] = 1
+  array[2] = 1
+
+  i = 3
+
+  while i < array.length
+
+    if i > 2
+      array[i] = array[array[i - 1]] + array[i - array[i - 1]]
+    end
+
+    i += 1
+  end
+
+  array.shift()
+  return array.join(" ")
+end

test/max_sub_array_test.rb

@@ -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]