码迷,mamicode.com
首页 > 编程语言 > 详细

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

时间:2018-12-11 14:32:00      阅读:207      评论:0      收藏:0      [点我收藏+]

标签:pytho   elf   input   lis   ati   problem   imu   turn   etc   

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:

  1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
  2. 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])

  

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

标签:pytho   elf   input   lis   ati   problem   imu   turn   etc   

原文地址:https://www.cnblogs.com/chiyeung/p/10101771.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!