Data_Structure_And_Algorithms/Dynamic Programming/maxProductarray.py at master · agaraman0/Data_Structure_And_Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# https://leetcode.com/problems/maximum-product-subarray/

def maxProduct(arr):
    n = len(arr)

    if n == 1:
        return arr[0]

    maxEnd = 1
    minEnd = 1
    mx = 1
    flag = 0
    flmx = 0

    for i in range(n):
        if arr[i] > 0:
            maxEnd = maxEnd*arr[i]
            minEnd = min(minEnd*arr[i],1)
            flmx = 1

        elif arr[i] == 0:
            minEnd = 1
            maxEnd = 1
            flag = 1
        elif arr[i]<0:
            temp = maxEnd
            maxEnd = max(minEnd*arr[i],1)
            minEnd = temp*arr[i]

        if maxEnd>mx:
            mx = maxEnd


        # print(maxEnd,minEnd,mx)

    if flag and flmx==0 and mx==1:
        return 0

    return mx