[LeetCode&Python] Problem 628. Maximum Product of Three Numbers

转载于 2018-12-11 13:56:00 发布 · 61 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/chiyeung/p/10101771.html

文章标签：

#python

本文介绍了一种高效算法，用于从整数数组中找出三个数，使得它们的乘积最大。通过排序和比较，该算法能在O(n log n)的时间复杂度内解决问题，适用于长度在3到10^4之间的数组。

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])

转载于:https://www.cnblogs.com/chiyeung/p/10101771.html