Python - Simple
\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        \n        nums.sort(reverse=1)\n        \n        for i in range(len(nums)-2
```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        \n        nums.sort(reverse=1)\n        \n        for i in range(len(nums)-2):\n            if nums[i] < nums[i+1] + nums[i+2]:\n                return sum(nums[i:i+3])\n\t\t\t\t\n        return 0\n```
['Python', 'Python3']