Count Good Triplets LeetCode solution in Java

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

16
  private static int helper(int x, int y) {
17
    return Math.abs(x - y);
18
  }
19
}