Python easy solution. Faster than 88.59%
Runtime: 209 ms, faster than 88.59% of Python3 online submissions for Largest Perimeter Triangle.\nMemory Usage: 15.4 MB, less than 91.33% of Python3 online sub
Runtime: 209 ms, **faster than 88.59%** of Python3 online submissions for Largest Perimeter Triangle.\nMemory Usage: 15.4 MB, **less than 91.33%** of Python3 online submissions for Largest Perimeter Triangle.\n```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        if len(nums) < 3:\n            return 0\n        \n        nums.sort(reverse = True)\n        for i in range(3,len(nums)+1):\n            if(nums[i-3] < nums[i-2] + nums[i-1]):\n                return sum(nums[i-3:i])\n        \n        return 0\n```\nKindly upvote if it helped you. Thanks :)
['Sorting', 'Python']