FilesExpand file tree

 master

/

max_product_subarray.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

21 lines (18 loc) · 534 Bytes

 master

/

max_product_subarray.py

Copy path

Top

File metadata and controls

• Code
• Blame

21 lines (18 loc) · 534 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

"""

Find the contiguous subarray within an array

(containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],

the contiguous subarray [2,3] has the largest product = 6.

"""

def max_product(nums):

"""

:type nums: List[int]

:rtype: int

"""

lmin = lmax = gmax = nums[0]

for i in range(len(nums)):

t1 = nums[i] * lmax

t2 = nums[i] * lmin

lmax = max(max(t1, t2), nums[i])

lmin = min(min(t1, t2), nums[i])

gmax = max(gmax, lmax)