| | 1 | | // -------------------------------------------------------------------------------- |
| | 2 | | // Copyright (C) 2025 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.MinimumLimitOfBallsInBag; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class MinimumLimitOfBallsInBagBinarySearch : IMinimumLimitOfBallsInBag |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n log m) |
| | 19 | | /// Space complexity - O(1) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="nums"></param> |
| | 22 | | /// <param name="maxOperations"></param> |
| | 23 | | /// <returns></returns> |
| | 24 | | public int MinimumSize(int[] nums, int maxOperations) |
| 2 | 25 | | { |
| 2 | 26 | | var left = 1; |
| 2 | 27 | | var right = nums.Max(); |
| | 28 | |
|
| 8 | 29 | | while (left < right) |
| 6 | 30 | | { |
| 6 | 31 | | var mid = left + ((right - left) / 2); |
| 21 | 32 | | var count = nums.Sum(num => (num - 1) / mid); |
| | 33 | |
|
| 6 | 34 | | if (count > maxOperations) |
| 2 | 35 | | { |
| 2 | 36 | | left = mid + 1; |
| 2 | 37 | | } |
| | 38 | | else |
| 4 | 39 | | { |
| 4 | 40 | | right = mid; |
| 4 | 41 | | } |
| 6 | 42 | | } |
| | 43 | |
|
| 2 | 44 | | return left; |
| 2 | 45 | | } |
| | 46 | | } |