-
Notifications
You must be signed in to change notification settings - Fork 53
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
Paper: Dynamic Programming #45
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well done Erika, you hit the learning goals here. Well done.
currSum = currSum + nums[i] | ||
if(currSum > maxSum): | ||
maxSum = currSum | ||
if(currSum < 0): | ||
currSum = 0 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Just a little simpler.
currSum = currSum + nums[i] | |
if(currSum > maxSum): | |
maxSum = currSum | |
if(currSum < 0): | |
currSum = 0 | |
currSum = max(currSum + nums[i], nums[i]) | |
maxSum = max(currSum, maxSum) |
# 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) | ||
""" |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Nice
No description provided.