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

corrected problem title

Browse Source
This commit is contained in:
umesh 2017-01-10 00:11:50 +05:30
parent 6f9d65f477
commit 655aecc338
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 max_sum_contagious_subarray 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.