We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6f9d65f commit 655aeccCopy full SHA for 655aecc
dynamic_programming/longest_sub_array.py
@@ -1,7 +1,7 @@
1
'''
2
Auther : Yvonne
3
4
-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.
5
6
The problem is :
7
Given an array, to find the longest and continuous sub array and get the max sum of the sub array in the given array.
0 commit comments