/ leetcodesolve / MaxSumusing(Khadangel).py
swadhinbiswas solve more problems · 1/29/2025
7c666b2
20 lines · 435 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
import math
from typing import List
class Solution(object):
    def maxSubArray(self,numbers:List[int])-> int:
        currentsum,maxsum = 0,-math.inf
        
        for start in range(len(numbers)):
            currentsum+=numbers[start]
            maxsum=max(currentsum,maxsum)
            if currentsum<0:
                currentsum=0
        return maxsum



solve=Solution().maxSubArray([-2,1,-3,4,-1,2,1,-5,4])

print(solve)