Python - Clean and Simple!
Solution:\n\nclass Solution:\n    def largestPerimeter(self, nums):\n        nums.sort(reverse=True)\n        \n        for i in range(len(nums)-2):\n          
**Solution**:\n```\nclass Solution:\n    def largestPerimeter(self, nums):\n        nums.sort(reverse=True)\n        \n        for i in range(len(nums)-2):\n            base, side1, side2 = nums[i], nums[i+1], nums[i+2]\n            if side1 + side2 > base:\n                return base + side1 + side2\n\n        return 0\n```
['Sorting', 'Python', 'Python3']