Share my Python solution
Sort the array, the maximum product happens in two situations:\nthe last three or the first two with the last one.\nHere is the Python code!\n\nclass Solution(o
Sort the array, the maximum product happens in two situations:\nthe last three or the first two with the last one.\nHere is the Python code!\n```\nclass Solution(object):\n    def maximumProduct(self, nums):\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        nums.sort()\n        return max(nums[-1]*nums[-2]*nums[-3], nums[0]*nums[1]*nums[-1])\n```
[]