very simple python solution,80%,2lines


  • 0
    W
    class Solution(object):
        def maximumProduct(self, nums):
            """
            :type nums: List[int]
            :rtype: int
            """
            nums.sort()
            return max(nums[-1]*nums[-2]*nums[-3],nums[-1]*nums[0]*nums[1])
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.