[LeetCode&Python] Problem 628. Maximum Product of Three Numbers
阿新 • • 發佈:2018-12-11
Given an integer array, find three numbers whose product is maximum and output the maximum product.
Example 1:
Input: [1,2,3] Output: 6
Example 2:
Input: [1,2,3,4] Output: 24
Note:
- The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
- Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
class Solution(object): def maximumProduct(self, nums): """ :type nums: List[int] :rtype: int """ n=sorted(nums) return max(n[-1]*n[-2]*n[-3],n[0]*n[1]*n[-1])