< Summary

Information
Class: LeetCode.Algorithms.MinimumNumberOfOperationsToMoveAllBallsToEachBox.MinimumNumberOfOperationsToMoveAllBallsToEachBoxBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfOperationsToMoveAllBallsToEachBox\MinimumNumberOfOperationsToMoveAllBallsToEachBoxBruteForce.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 41
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinOperations(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfOperationsToMoveAllBallsToEachBox\MinimumNumberOfOperationsToMoveAllBallsToEachBoxBruteForce.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.MinimumNumberOfOperationsToMoveAllBallsToEachBox;
 13
 14/// <inheritdoc />
 15public class MinimumNumberOfOperationsToMoveAllBallsToEachBoxBruteForce :
 16    IMinimumNumberOfOperationsToMoveAllBallsToEachBox
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n^2)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="boxes"></param>
 23    /// <returns></returns>
 24    public int[] MinOperations(string boxes)
 225    {
 226        var result = new int[boxes.Length];
 27
 2228        for (var i = 0; i < boxes.Length; i++)
 929        {
 10830            for (var j = 0; j < boxes.Length; j++)
 4531            {
 4532                if (boxes[j] == '1' && i != j)
 1933                {
 1934                    result[i] += Math.Abs(j - i);
 1935                }
 4536            }
 937        }
 38
 239        return result;
 240    }
 41}

Methods/Properties

MinOperations(System.String)