Update maximum-subarray.py

kamyu104 · web-flow · commit f9fedc428554 · 2016-09-21T09:31:35.000+08:00
diff --git a/Python/maximum-subarray.py b/Python/maximum-subarray.py
@@ -12,15 +12,20 @@
 # If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
 #
 
-class Solution:
-    # @param A, a list of integers
-    # @return an integer
-    def maxSubArray(self, A):
+class Solution(object):
+    def maxSubArray(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        if max(nums) < 0:
+            return max(nums)
         global_max, local_max = float("-inf"), 0
-        for x in A:
+        for x in nums:
             local_max = max(0, local_max + x)
             global_max = max(global_max, local_max)
         return global_max
 
+
 if __name__ == "__main__":
-    print Solution().maxSubArray([-2,1,-3,4,-1,2,1,-5,4])
+    print Solution().maxSubArray([-2,1,-3,4,-1,2,1,-5,4])
