python leetcode 628. Maximum Product of Three Numbers

最新推荐文章于 2020-09-04 15:30:08 发布

DreamerLHQ

最新推荐文章于 2020-09-04 15:30:08 发布

阅读量166

点赞数

分类专栏： leetcode_python 文章标签： python leetcode

本文链接：https://blog.csdn.net/DreamerLHQ/article/details/84590885

版权

leetcode_python 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

Given an integer array, find three numbers whose product is maximum and output the maximum product.

找出列表中三个数乘积最大的结果。

将列表升序排序，由于存在负数的情况，则结果为max(最后三个数乘积，负数情况下前面两个数乘积再乘最后一个数)

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:
def maximumProduct(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
nums.sort()
return max(nums[0]*nums[1]*nums[-1], nums[-1]*nums[-2]*nums[-3])