leetcode-三角形的最大周长
Python解法:
class Solution: def largestPerimeter(self, A: List[int]) -> int: A.sort() for i in range(len(A) - 3, -1, -1): if A[i] + A[i+1] > A[i+2]: return A[i] + A[i+1] + A[i+2] return 0
Try to be a giver
Python解法:
class Solution: def largestPerimeter(self, A: List[int]) -> int: A.sort() for i in range(len(A) - 3, -1, -1): if A[i] + A[i+1] > A[i+2]: return A[i] + A[i+1] + A[i+2] return 0