Maximum Subarray

Author: anantkaushik

053-maximum-subarray.py

@@ -0,0 +1,20 @@
+"""
+Problem Link: https://leetcode.com/problems/maximum-subarray/description/
+
+Given an integer array nums, find the contiguous subarray 
+(containing at least one number) which has the largest sum and return its sum.
+
+Example:
+Input: [-2,1,-3,4,-1,2,1,-5,4],
+Output: 6
+Explanation: [4,-1,2,1] has the largest sum = 6.
+"""
+class Solution:
+ def maxSubArray(self, nums: List[int]) -> int:
+ max_sum = cur_sum = float('-inf')
+ 
+ for num in nums:
+ cur_sum = max(cur_sum + num, num)
+ max_sum = max(max_sum, cur_sum)
+ 
+ return max_sum