Skip to content

Conversation

@julianadecarvalho
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

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

These work Juliana, but you didn't try the time/space complexities.

Comment on lines +13 to +19
now_max = 0
max_ending_here = nums[0]

for i in range(len(nums)):
now_max = max(nums[i], now_max + nums[i])
max_ending_here = max(max_ending_here, now_max)
return max_ending_here

Choose a reason for hiding this comment

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

👍 Nicely done. Time/space complexity?

Comment on lines +10 to +19
if num == 0:
raise ValueError

if num == 1:
return '1'

sequence = [0, 1, 1]
for i in range(3, num + 1):
sequence.append (sequence[sequence[i - 1]] + sequence[i - sequence[i -1]])
return ' '.join([str(s) for s in sequence[1:]])

Choose a reason for hiding this comment

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

👍 However time/space complexity?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants