-
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-Saejin #47
base: master
Are you sure you want to change the base?
Paper-Saejin #47
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.
Nicely done Saejin, you hit the learning goals here. Well done.
max_ending_here = max_ending_here + nums[i] | ||
if max_ending_here < 0: | ||
max_ending_here = max(max_ending_here, nums[i]) | ||
if max_so_far < max_ending_here: | ||
max_so_far = max_ending_here |
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.
This could be simplified a bit using the max
function so you wouldn't need the if statements.
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: On | ||
Space Complexity: O1 |
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.
👍
def newman_conway(num): | ||
""" Returns a list of the Newman Conway numbers for the given value. | ||
Time Complexity: ? | ||
Space Complexity: ? | ||
Time Complexity: On | ||
Space Complexity: On |
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.
👍
No description provided.