6 lines
\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort(reverse=True)\n        for i in range(len(nums)-2):\n            a
```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort(reverse=True)\n        for i in range(len(nums)-2):\n            a,b,c=nums[i],nums[i+1],nums[i+2]\n            if( not (a+b<=c or b+c<=a or c+a<=b)):\n                return a+b+c\n        return 0\n```
['Python']