Count Good Triplets LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countGoodTriplets(vector<int> &arr, int a, int b, int c) {
4
    int ct = 0;
5
    for (int i = 0; i < arr.size() - 2; i++) {
6
      for (int j = i + 1; j < arr.size() - 1; j++) {
7
        if (abs(arr[i] - arr[j]) <= a)
8
          for (int k = j + 1; k < arr.size(); k++) {
9
            if (abs(arr[j] - arr[k]) <= b && abs(arr[i] - arr[k]) <= c) ct++;
10
          }
11
      }
12
    }
13
    return ct;
14
  }
15
};