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.

Sign up for GitHub

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

Jump to bottom

[014. Maximum Subarray]It's DP..not greedy.. #10

Closed

Mooophy opened this issue Apr 9, 2015 · 0 comments

Assignees

Labels

bug

Contributor

Mooophy commented Apr 9, 2015

Because of the way this algorithm uses optimal substructures (the maximum subarray ending at each position is calculated in a simple way from a related but smaller and overlapping subproblem: the maximum subarray ending at the previous position) this algorithm can be viewed as a simple example of dynamic programming.

From Maximum subarray problem on Wiki

pezy closed this as completed in

f606c12

pezy self-assigned this

pezy added the bug label

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