< Summary

Information
Class: LeetCode.Algorithms.MinimumLimitOfBallsInBag.MinimumLimitOfBallsInBagBinarySearch
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumLimitOfBallsInBag\MinimumLimitOfBallsInBagBinarySearch.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 46
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumSize(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumLimitOfBallsInBag\MinimumLimitOfBallsInBagBinarySearch.cs

#LineLine coverage
 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
 12namespace LeetCode.Algorithms.MinimumLimitOfBallsInBag;
 13
 14/// <inheritdoc />
 15public 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)
 225    {
 226        var left = 1;
 227        var right = nums.Max();
 28
 829        while (left < right)
 630        {
 631            var mid = left + ((right - left) / 2);
 2132            var count = nums.Sum(num => (num - 1) / mid);
 33
 634            if (count > maxOperations)
 235            {
 236                left = mid + 1;
 237            }
 38            else
 439            {
 440                right = mid;
 441            }
 642        }
 43
 244        return left;
 245    }
 46}