mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 08:56:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #63 from umsh1ume/master

Browse Source 
Corrected title in longest_sub_array
This commit is contained in:
Harshil 2017-01-10 07:34:36 +05:30 committed by GitHub
commit d68666ddba
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
dynamic_programming/longest_sub_array.py
View File

@ -1,7 +1,7 @@
''' '''
Auther : Yvonne 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 : 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. Given an array, to find the longest and continuous sub array and get the max sum of the sub array in the given array.