| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MinimizeTheMaximumDifferenceOfPairs; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MinimizeTheMaximumDifferenceOfPairsBinarySearch : IMinimizeTheMaximumDifferenceOfPairs |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n + n log R), where R = max(nums) - min(nums) |
| | | 19 | | /// Space complexity - O(log n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="requiredPairsCount"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int MinimizeMax(int[] nums, int requiredPairsCount) |
| | 2 | 25 | | { |
| | 2 | 26 | | if (requiredPairsCount == 0) |
| | 0 | 27 | | { |
| | 0 | 28 | | return 0; |
| | | 29 | | } |
| | | 30 | | |
| | 2 | 31 | | Array.Sort(nums); |
| | | 32 | | |
| | 2 | 33 | | var low = 0; |
| | 2 | 34 | | var high = nums[^1] - nums[0]; |
| | | 35 | | |
| | 8 | 36 | | while (low < high) |
| | 6 | 37 | | { |
| | 6 | 38 | | var mid = low + ((high - low) / 2); |
| | | 39 | | |
| | 6 | 40 | | if (CanFormEnoughPairs(nums, mid, requiredPairsCount)) |
| | 5 | 41 | | { |
| | 5 | 42 | | high = mid; |
| | 5 | 43 | | } |
| | | 44 | | else |
| | 1 | 45 | | { |
| | 1 | 46 | | low = mid + 1; |
| | 1 | 47 | | } |
| | 6 | 48 | | } |
| | | 49 | | |
| | 2 | 50 | | return low; |
| | 2 | 51 | | } |
| | | 52 | | |
| | | 53 | | private static bool CanFormEnoughPairs(int[] nums, int x, int requiredPairsCount) |
| | 6 | 54 | | { |
| | 6 | 55 | | var numsLength = nums.Length; |
| | | 56 | | |
| | 6 | 57 | | var pairsCount = 0; |
| | | 58 | | |
| | 28 | 59 | | for (var i = 0; i < numsLength - 1; i++) |
| | 13 | 60 | | { |
| | 13 | 61 | | if (nums[i + 1] - nums[i] > x) |
| | 4 | 62 | | { |
| | 4 | 63 | | continue; |
| | | 64 | | } |
| | | 65 | | |
| | 9 | 66 | | pairsCount++; |
| | | 67 | | |
| | 9 | 68 | | if (pairsCount == requiredPairsCount) |
| | 5 | 69 | | { |
| | 5 | 70 | | return true; |
| | | 71 | | } |
| | | 72 | | |
| | 4 | 73 | | i++; |
| | 4 | 74 | | } |
| | | 75 | | |
| | 1 | 76 | | return false; |
| | 6 | 77 | | } |
| | | 78 | | } |