LeetCode 1534 - 统计好三元组

class Solution:
    def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int:
        cnt = 0
        leng = len(arr)
        for i in range(leng):
            for j in range(i + 1, leng):
                for k in range(j + 1, leng):
                    if abs(arr[i] - arr[j]) <= a and abs(arr[j] - arr[k]) <= b and abs(arr[i] - arr[k]) <= c:
                        cnt += 1
        return cnt