Python faster than 100%
Sort the list, then go through the triples of numbers starting with the largest triple. \n\nReturn the perimeter of the first valid triangle.\n\n\ndef largestPe
Sort the list, then go through the triples of numbers starting with the largest triple. \n\nReturn the perimeter of the first valid triangle.\n\n```\ndef largestPerimeter(nums):\n    if len(nums) < 3: return 0\n    nums.sort(reverse=True)\n    a, b = nums[:2]\n    for c in nums[2:]:\n        if b + c > a:\n            return a + b + c\n        a, b = b, c\n    return 0\n```
['Python']