Runtime: 1794 ms (Top 11.20%) | Memory: 13.8 MB (Top 87.90%)

Author: AnasImloul

scripts/algorithms/C/Count Good Triplets/Count Good Triplets.py

@@ -1,3 +1,4 @@
+# Runtime: 1794 ms (Top 11.20%) | Memory: 13.8 MB (Top 87.90%)
 class Solution:
     def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int:
         count = 0
@@ -6,4 +7,4 @@ def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int:
                 for k in range(j+1,len(arr)):
                     if abs(arr[i]-arr[j])<=a and abs(arr[j]-arr[k])<=b and abs(arr[k]-arr[i])<=c:
                         count+=1
-        return count
+        return count