Python O( n log n ) sol. based on sorting. run-time 80%+
Python O( n log n ) sol. based on sorting\n\n\nclass Solution:\n    def maximumProduct(self, nums: List[int]) -> int:\n\n        # sort the nums with ascending 
Python O( n log n ) sol. based on sorting\n\n```\nclass Solution:\n    def maximumProduct(self, nums: List[int]) -> int:\n\n        # sort the nums with ascending order        \n        nums.sort()\n        \n        # for possible solution_#1: First three largest positive numbers\n        candidate_1 = nums[-1] * nums[-2] * nums[-3]\n\n        # for possible solution_#2: First two smallest negative numbers, whit one largest positive number.\n        candidate_2 = nums[-1]*nums[0]*nums[1]\n        \n        max_product = max( candidate_1, candidate_2)\n        \n        return max_product\n\n```
['Sorting', 'Python']