-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
33 lines (28 loc) · 870 Bytes
/
solution.py
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
class Solution(object):
def maximumProduct(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
# maximum product must be max1 * max2 * max3 or max1 * min1 * min2
max1 = - sys.maxint
max2 = - sys.maxint
max3 = - sys.maxint
min1 = sys.maxint
min2 = sys.maxint
for num in nums:
if num >= max1:
max3 = max2
max2 = max1
max1 = num
elif num >= max2:
max3 = max2
max2 = num
elif num >= max3:
max3 = num
if num <= min1:
min2 = min1
min1 = num
elif num <= min2:
min2 = num
return max(max1 * max2 * max3, max1 * min1 * min2)