[Python] Built-in sort method (100 % speed, 100 % mem)
Built-in sort method \n\nWhy write efficient code when it\'s been written for you? \n\n\nclass Solution(object):\n    def maxProduct(self, nums):\n        nums.
# Built-in sort method \n\nWhy write efficient code when it\'s been written for you? \n\n```\nclass Solution(object):\n    def maxProduct(self, nums):\n        nums.sort()\n        return (nums[-1] -1) * (nums[-2]-1)\n        """\n        :type nums: List[int]\n        :rtype: int\n        """\n        \n```\n\n## **100 % on both memory and speed! (28 ms, 12.6 MB)**\n
['Python', 'Python3']