Leetcode 1534. 统计好三元组

1534. 统计好三元组

Ideas

算法：迭代

Code

时间复杂度：O(n^3)
空间复杂度：O(1)

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