leetcode

commit 7476182e864c8d93f9da250789c163b7c1030b48
parent 6167455d5177400d604fd64272d3fd1be8aebee3
Author: Jack Sangdahl <jack@pngu.org>
Date:   Fri, 23 Jan 2026 19:26:16 -0700

1877. minimise maximum pair sum in array

Diffstat:
M
min_max_pair_arr.c
 | 
16
++++++----------

1 file changed, 6 insertions(+), 10 deletions(-)
diff --git a/min_max_pair_arr.c b/min_max_pair_arr.c
@@ -10,17 +10,13 @@
  * elements.
  */
 
-int cmp(const void *a, const void *b) {
-  return *(const int *)a - *(const int *)b;
-}
+int cmp(const void *a, const void *b) { return *(int *)a < *(int *)b; }
 
-int minPairSum(int *nums, int nums_size) {
-  qsort(nums, nums_size, sizeof(int), cmp);
-  int start = 0, end = nums_size - 1, ans = 0;
-  while (start < end) {
-    int tmp = nums[start++] + nums[end--];
-    ans = tmp > ans ? tmp : ans;
-  }
+int minPairSum(int *nums, int numsSize) {
+  qsort(nums, numsSize, sizeof(int), cmp);
+  int ans = 0, left = 0, right = numsSize - 1;
+  while (left < right)
+    ans = fmax(ans, nums[left++] + nums[right--]);
   return ans;
 }