Count Good Triplets LeetCode solution in JavaScript

1
var countGoodTriplets = function (arr, a, b, c) {
2
let triplets = 0;
3

4
for (let i = 0; i < arr.length - 2; i++) {
5
for (let j = i + 1; j < arr.length - 1; j++) {
6
if (Math.abs(arr[i] - arr[j]) > a) continue;
7
for (let k = j + 1; k < arr.length; k++) {
8
if (Math.abs(arr[j] - arr[k]) > b || Math.abs(arr[i] - arr[k]) > c) {
9
continue;
10
}
11
triplets++;
12
}
13
}
14
}
15

16
return triplets;
17
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0