From 655aecc3389586d920a789b54a50c6efef2b6c10 Mon Sep 17 00:00:00 2001 From: umesh Date: Tue, 10 Jan 2017 00:11:50 +0530 Subject: [PATCH 1/2] corrected problem title --- dynamic_programming/longest_sub_array.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/dynamic_programming/longest_sub_array.py b/dynamic_programming/longest_sub_array.py index b9a5e8de7dad..8fc84e73a183 100644 --- a/dynamic_programming/longest_sub_array.py +++ b/dynamic_programming/longest_sub_array.py @@ -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 max_sum_contagious_subarray 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. From a43d0f312af106b9e0d63c0607a984666db97ae6 Mon Sep 17 00:00:00 2001 From: umesh Date: Tue, 10 Jan 2017 00:14:48 +0530 Subject: [PATCH 2/2] corrected title --- dynamic_programming/longest_sub_array.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/dynamic_programming/longest_sub_array.py b/dynamic_programming/longest_sub_array.py index 8fc84e73a183..988041ed0244 100644 --- a/dynamic_programming/longest_sub_array.py +++ b/dynamic_programming/longest_sub_array.py @@ -1,7 +1,7 @@ ''' Auther : Yvonne -This is a pure Python implementation of Dynamic Programming solution to the max_sum_contagious_subarray 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.