Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

53. Maximum Subarray #36

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

Merged
zwfang merged 1 commit into master from maximum-subarray
Jan 2, 2019
Merged

53. Maximum Subarray #36

zwfang merged 1 commit into master from maximum-subarray
Jan 2, 2019

Conversation

Copy link
Collaborator

@zwfang zwfang commented Jan 2, 2019

https://leetcode.com/problems/maximum-subarray/

Given an integer array nums,
find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

@zwfang zwfang added array An array is stored such that the position of each element can be computed from its index Easy Coefficient of difficulty easy dynamic programming optimal substructure and overlapping sub-problem are two key attributes for dynamic programming. labels Jan 2, 2019
Copy link

codecov bot commented Jan 2, 2019
edited
Loading

Codecov Report

Merging #36 into master will increase coverage by 0.02%.
The diff coverage is 100%.

Impacted file tree graph

@@ Coverage Diff @@
## master #36 +/- ##
==========================================
+ Coverage 99.27% 99.28% +0.02% 
==========================================
 Files 77 78 +1 
 Lines 1365 1384 +19 
==========================================
+ Hits 1355 1374 +19 
 Misses 6 6 
 Partials 4 4
Impacted Files Coverage Δ
src/0053_maximum_subarray/maximum_subarray.go 100% <100%> (ø)

@zwfang zwfang merged commit bc3804b into master Jan 2, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
array An array is stored such that the position of each element can be computed from its index dynamic programming optimal substructure and overlapping sub-problem are two key attributes for dynamic programming. Easy Coefficient of difficulty easy
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

1 participant

AltStyle によって変換されたページ (->オリジナル) /