aboutsummaryrefslogtreecommitdiff
path: root/min_max_diff_pair.c
diff options
context:
space:
mode:
Diffstat (limited to 'min_max_diff_pair.c')
-rw-r--r--min_max_diff_pair.c18
1 files changed, 8 insertions, 10 deletions
diff --git a/min_max_diff_pair.c b/min_max_diff_pair.c
index 6172bc7..7577e3b 100644
--- a/min_max_diff_pair.c
+++ b/min_max_diff_pair.c
@@ -1,6 +1,5 @@
// 2616. Minimize the Maximum Difference of Pairs
-#include <stdio.h>
-#include <stdlib.h>
+#include "leetcode.h"
/*
* given a 0-indexed integer array 'nums' and an integer 'p'. find 'p' pairs of
@@ -14,13 +13,12 @@
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
-int minimizeMax(int *nums, int nums_size, int p) {
- qsort(nums, nums_size, sizeof(int), cmp);
- int i, j, left = 0, right = nums[nums_size - 1] - nums[0];
+int minimizeMax(int *nums, int numsSize, int p) {
+ qsort(nums, numsSize, sizeof(int), cmp);
+ int i, j, left = 0, right = nums[numsSize - 1] - nums[0];
while (left < right) {
- int mid = (left + right) / 2;
- int cnt = 0;
- for (int i = 0; i + 1 < nums_size; ++i)
+ int mid = (left + right) / 2, cnt = 0;
+ for (int i = 0; i + 1 < numsSize; ++i)
if (mid >= nums[i + 1] - nums[i])
++cnt, ++i;
if (cnt >= p)
@@ -33,6 +31,6 @@ int minimizeMax(int *nums, int nums_size, int p) {
int main() {
int n1[] = {10, 1, 2, 7, 1, 3}, n2[] = {4, 2, 1, 2};
- printf("%d\n", minimizeMax(n1, 6, 2)); // expect: 1
- printf("%d\n", minimizeMax(n2, 4, 1)); // expect: 0
+ printf("%d\n", minimizeMax(n1, ARRAY_SIZE(n1), 2)); // expect: 1
+ printf("%d\n", minimizeMax(n2, ARRAY_SIZE(n2), 1)); // expect: 0
}