Jiajia(Grace) Wang

.vscode/settings.json

@@ -0,0 +1,7 @@
+{
+    "python.testing.pytestArgs": [
+        "tests"
+    ],
+    "python.testing.unittestEnabled": false,
+    "python.testing.pytestEnabled": true
+}

lib/max_subarray.py

@@ -1,4 +1,4 @@
-
+import math
 def max_sub_array(nums):
     """ Returns the max subarray of the given list of numbers.
         Returns 0 if  nums is None or an empty list.
@@ -9,4 +9,16 @@ def max_sub_array(nums):
         return 0
     if len(nums) == 0:
         return 0
-    pass
+    largest_sum = [0] * len(nums)
+    largest_sum[0] = nums[0]
+
+    for i in range(1, len(nums)):
+        if largest_sum[i - 1] <= 0:
+            largest_sum[i] = nums[i]
+
+        else:
+            largest_sum[i] = nums[i] + largest_sum[i-1]
+
+    return max(largest_sum)
+
+

lib/newman_conway.py

@@ -1,10 +1,26 @@
 
 
-# Time complexity: ?
-# Space Complexity: ?
+# Time complexity: o(n)
+# Space Complexity: o(n)
 def newman_conway(num):
     """ Returns a list of the Newman Conway numbers for the given value.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: o(n)
+        Space Complexity: o(n)
     """
-    pass
+    nc_list = [0] * (num + 1)
+    if num == 0:
+        raise ValueError("n must be > 0")
+    if num == 1:
+        return "1"
+    if num == 2:
+        return "1 1"
+    if num > 2:
+        nc_list[1] = 1
+        nc_list[2] = 1
+        for i in range(3, num + 1):
+
+            nc_list[i] = nc_list[nc_list[i-1]] + nc_list[i - nc_list[i-1]]
+
+        return " ".join(str(v) for v in nc_list[1:])
+print(newman_conway(1))
+