aboutsummaryrefslogtreecommitdiff
path: root/count_good_triplets.c
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-04-13 22:13:22 -0600
committerJack Sangdahl <[email protected]>2025-04-13 22:13:22 -0600
commit92be08029f6d746dcae75c87533840f5b030b610 (patch)
tree2c89fbcac969f9182f5748d6dac132e3f2242c32 /count_good_triplets.c
parente5d733871eda3cb090b121b0d1a6c904fb6bb71c (diff)
downloadleetcode-92be08029f6d746dcae75c87533840f5b030b610.tar.gz
leetcode-92be08029f6d746dcae75c87533840f5b030b610.zip
1534. count good triplets
Diffstat (limited to 'count_good_triplets.c')
-rw-r--r--count_good_triplets.c29
1 files changed, 29 insertions, 0 deletions
diff --git a/count_good_triplets.c b/count_good_triplets.c
new file mode 100644
index 0000000..9275841
--- /dev/null
+++ b/count_good_triplets.c
@@ -0,0 +1,29 @@
+// 1534. Count Good Triplets
+#include "leetcode.h"
+
+/*
+ * given an array of integers 'arr', and three integers 'a, b, c', yo need to
+ * find the number of good triplets. a triplet '(arr[i], arr[j], arr[k])' is
+ * good if the following conditions are met: '0 <= i < j < k < arr.len, |arr[i]
+ * - arr[j]| <= (a, b, c)' where '|x|' denotes the absolute value of 'x'. return
+ * the number of good triplets.
+ */
+
+int countGoodTriplets(int *arr, int arrSize, int a, int b, int c) {
+ int cnt = 0;
+ for (int i = 0; i < arrSize - 2; i++)
+ for (int k = i + 2; k < arrSize; k++) {
+ if (abs(arr[k] - arr[i]) > c)
+ continue;
+ for (int j = i + 1; j < k; j++)
+ if (abs(arr[i] - arr[j]) <= a && abs(arr[j] - arr[k]) <= b)
+ ++cnt;
+ }
+ return cnt;
+}
+
+int main() {
+ int a1[] = {3, 0, 1, 1, 9, 7}, a2[] = {1, 1, 2, 2, 3};
+ printf("%d\n", countGoodTriplets(a1, ARRAY_SIZE(a1), 7, 2, 3)); // expect: 4
+ printf("%d\n", countGoodTriplets(a2, ARRAY_SIZE(a2), 0, 0, 1)); // expect: 0
+}