leetcode976-largest-perimeter-triangle.py

fromtypingimportList
classSolution:
deflargestPerimeter(self, A: List[int]) ->int:
if (len(A) <3):
return0

A.sort(reverse=True)
foriinrange(len(A)-2):
ifA[i] <A[i+1] +A[i+2]: # Can build a triangle
returnA[i] +A[i+1] +A[i+2]
return0

# Below is testing
sol=Solution()
print(sol.largestPerimeter([4, 5, 2, 7]))