Maximum Subarray - Leetcode

maximum_subarray.py

# https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/528/week-1/3285/

def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        maximum = nums[0]
        current = 0
        for i in range(len(nums)):
            current = max(nums[i], current + nums[i])
            if current > maximum:
                maximum = current
        
        return maximum



def maxSubArrayBruteForce(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        maximum = nums[0]
        for i in range(len(nums) + 1):
            for j in range(len(nums) + 1):
                if nums[i:j]:   
                    current = sum(nums[i:j])   
                    if current > maximum:
                        maximum = current
        
        return maximum