/ leetcodesolve / BrouteForceforMaxSUbarray.py
swadhinbiswas solve more problems · 1/29/2025
7c666b2
20 lines · 370 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20


class Solution(object):
    def maxSubarray(self,array):
        max_sum = -1
        for start in range(len(array)):
            arraysum=0
            for end in range(start,len(array)):
                arraysum+=array[end]
                max_sum=max(max_sum,arraysum)

        return max_sum




x=Solution().maxSubarray([3,-4,5,4,-1,12,-8])
print(x)