Package g1501_1600.s1534_count_good_triplets

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1534 - Count Good Triplets.

    Easy

    Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets.

    A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true:

    • 0 <= i < j < k < arr.length

    • |arr[i] - arr[j]| <= a

    • |arr[j] - arr[k]| <= b

    • |arr[i] - arr[k]| <= c

    Where |x| denotes the absolute value of x.

    Return the number of good triplets.

    Example 1:

    Input: arr = 3,0,1,1,9,7, a = 7, b = 2, c = 3

    Output: 4

    Explanation: There are 4 good triplets: (3,0,1), (3,0,1), (3,1,1), (0,1,1).

    Example 2:

    Input: arr = 1,1,2,2,3, a = 0, b = 0, c = 1

    Output: 0

    Explanation: No triplet satisfies all conditions.

    Constraints:

    • 3 <= arr.length <= 100

    • 0 <= arr[i] <= 1000

    • 0 <= a, b, c <= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countGoodTriplets(IntArray arr, Integer a, Integer b, Integer c)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait