Skip to content

Commit 5b28a79

Browse files
committed
Do daily
1 parent 0badd88 commit 5b28a79

File tree

3 files changed

+37
-0
lines changed

3 files changed

+37
-0
lines changed

my-submissions/e1534_v1.c

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
int countGoodTriplets(int* arr, int arrSize, int a, int b, int c){
2+
int cnt = 0;
3+
4+
for (int i = 0; i < arrSize - 2; i++) {
5+
for (int j = i + 1; j < arrSize - 1; j++) {
6+
for (int k = j + 1; k < arrSize; k++) {
7+
if (
8+
abs(arr[i] - arr[j]) <= a &&
9+
abs(arr[j] - arr[k]) <= b &&
10+
abs(arr[i] - arr[k]) <= c
11+
) {
12+
cnt++;
13+
}
14+
}
15+
}
16+
}
17+
18+
return cnt;
19+
}
+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
class Solution:
2+
def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) -> int:
3+
output = 0
4+
for i in range(len(arr) - 2) :
5+
for j in range(i + 1, len(arr) - 1) :
6+
for k in range(j + 1, len(arr)) :
7+
if abs(arr[i] - arr[j]) <= a and \
8+
abs(arr[j] - arr[k]) <= b and \
9+
abs(arr[i] - arr[k]) <= c :
10+
output += 1
11+
return output
+7
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
int countGoodTriplets(int* arr, int arrSize, int a, int b, int c){
2+
int cnt = 0;
3+
for (int i = 0; i < arrSize - 2; i++) { for (int j = i + 1; j < arrSize - 1; j++) { for (int k = j + 1; k < arrSize; k++) {
4+
if (abs(arr[i] - arr[j]) <= a && abs(arr[j] - arr[k]) <= b && abs(arr[i] - arr[k]) <= c) { cnt++; }
5+
}}}
6+
return cnt;
7+
}

0 commit comments

Comments
 (0)