< Summary

Information
Class: LeetCode.Algorithms.ArrangingCoins.ArrangingCoinsBinarySearch
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ArrangingCoins\ArrangingCoinsBinarySearch.cs
Line coverage
100%
Covered lines: 20
Uncovered lines: 0
Coverable lines: 20
Total lines: 50
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
ArrangeCoins(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ArrangingCoins\ArrangingCoinsBinarySearch.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.ArrangingCoins;
 13
 14/// <inheritdoc />
 15public class ArrangingCoinsBinarySearch : IArrangingCoins
 16{
 17    /// <summary>
 18    ///     Time complexity - O(log n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="n"></param>
 22    /// <returns></returns>
 23    public int ArrangeCoins(int n)
 1024    {
 1025        long left = 0;
 1026        long right = n;
 27
 3328        while (left <= right)
 2729        {
 2730            var mid = left + ((right - left) / 2);
 2731            var curr = mid * (mid + 1) / 2;
 32
 2733            if (curr == n)
 434            {
 435                return (int)mid;
 36            }
 37
 2338            if (curr < n)
 1439            {
 1440                left = mid + 1;
 1441            }
 42            else
 943            {
 944                right = mid - 1;
 945            }
 2346        }
 47
 648        return (int)right;
 1049    }
 50}

Methods/Properties

ArrangeCoins(System.Int32)