Skip to content

Corrected title in longest_sub_array #63

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

Merged
harshildarji merged 2 commits into from
Jan 10, 2017
Merged

Corrected title in longest_sub_array #63

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
655aecc
corrected problem title
umsh1ume Jan 9, 2017
a43d0f3
corrected title
umsh1ume Jan 9, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion dynamic_programming/longest_sub_array.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
'''
Auther : Yvonne

This is a pure Python implementation of Dynamic Programming solution to the edit distance problem.
This is a pure Python implementation of Dynamic Programming solution to the longest_sub_array problem.

The problem is :
Given an array, to find the longest and continuous sub array and get the max sum of the sub array in the given array.
Expand Down