solved maxsubarray sum

eloyekunle · eloyekunle · commit 015523c76636 · 2018-09-20T12:34:46.000+01:00
diff --git a/hackerrank/dynamic_programming/maxsubarray.py b/hackerrank/dynamic_programming/maxsubarray.py
@@ -8,25 +8,19 @@
 
 # Complete the maxSubarray function below.
 def maxSubarray(arr):
-    max_subseq_sum = None
-    max_subarr_sum = None
-
     if max(arr) <= 0:
         max_subarr_sum = max_subseq_sum = max(arr)
     elif min(arr) >= 0:
         max_subarr_sum = max_subseq_sum = sum(arr)
     else:
         max_subarr_sum = max_subarr_ending_here = arr[0]
-        max_subseq_sum = max_subseq_ending_here = 0
+        max_subseq_sum = max(arr[0], 0)
 
         for i in range(1, len(arr)):
             el = arr[i]
             max_subarr_ending_here = max(el, max_subarr_ending_here + el)
             max_subarr_sum = max(max_subarr_sum, max_subarr_ending_here)
-
-        for el in arr:
-            max_subseq_ending_here = max(el, 0)
-            max_subseq_sum += max_subseq_ending_here
+            max_subseq_sum += max(el, 0)
 
     return [max_subarr_sum, max_subseq_sum]
 
