Skip to content
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
14 changes: 11 additions & 3 deletions lib/max_subarray.py
Original file line number Diff line number Diff line change
Expand Up @@ -2,11 +2,19 @@
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.
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(n)
Space Complexity: O(1)
Comment on lines 2 to +6

Choose a reason for hiding this comment

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

👍

"""
if nums == None:
return 0
if len(nums) == 0:
return 0
pass

temp_max = 0
true_max = nums[0]

for i in range(len(nums)):
temp_max = max(nums[i], temp_max + nums[i])
true_max = max(true_max, temp_max)

return true_max
22 changes: 17 additions & 5 deletions lib/newman_conway.py
Original file line number Diff line number Diff line change
@@ -1,10 +1,22 @@


# Time complexity: ?
# Space Complexity: ?
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
Comment on lines 3 to -10

Choose a reason for hiding this comment

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

👍

if num == 0:
raise ValueError

if num == 1:
return "1"

if num == 2:
return "1 1"

nums = [0, 1, 1]

for i in range (3, num + 1):
nums.append(nums[nums[i-1]] + nums[i - nums[i-1]])

return " ".join([str(item) for item in nums[1:num+1]])