-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram39.java
More file actions
70 lines (46 loc) · 1.65 KB
/
program39.java
File metadata and controls
70 lines (46 loc) · 1.65 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
1534. Count Good Triplets
Easy
642
1.1K
Companies
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.
*/
package LeetCode;
public class program39 {
static int countGoodTriplets(int[] arr, int a, int b, int c) {
int triplet=0;
for(int i=0;i<arr.length;i++){
for(int j=i+1;j<arr.length;j++){
for(int k=j+1;k<arr.length;k++){
if(Math.abs(arr[i]-arr[j])<=a && Math.abs(arr[j]-arr[k])<=b && Math.abs(arr[i]-arr[k])<=c){
triplet++;
}
}
}
}
return triplet;
}
public static void main(String[] args) {
int[] arr={1,1,2,2,3};
int a=0;
int b=0;
int c=1;
System.out.println(countGoodTriplets(arr, a, b, c));
}
}