• Home
• com.github.javadev
• leetcode-in-all
• 1.3
• source code
• Solution.py

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0001_0100.s0053_maximum_subarray.Solution.py Maven / Gradle / Ivy

# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
# #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
# #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
# #2024_06_08_Time_501_ms_(83.84%)_Space_30.7_MB_(91.05%)

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        maxi = float('-inf')
        sum_val = 0
        for num in nums:
            # calculating sub-array sum
            sum_val += num
            maxi = max(sum_val, maxi)
            if sum_val < 0:
                # there is no point to carry a -ve subarray sum. hence setting to 0
                sum_val = 0
        return maxi