题目地址 https://binarysearch.com/problems/Triangle-Triplets 解答 class Solution: def solve(self, nums): nums.sort() res = 0 for k in range(len(nums)-1,-1,-1): i = 0 j = k-1 while i < j: if nums[i] + nums[j] > nums[k]: res += j-i j -= 1 else: i += 1 return res