< Summary

Information
Class: LeetCode.Algorithms.FruitsIntoBaskets2.FruitsIntoBaskets2BruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FruitsIntoBaskets2\FruitsIntoBaskets2BruteForce.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 47
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
NumOfUnplacedFruits(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FruitsIntoBaskets2\FruitsIntoBaskets2BruteForce.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.FruitsIntoBaskets2;
 13
 14/// <inheritdoc />
 15public class FruitsIntoBaskets2BruteForce : IFruitsIntoBaskets2
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n * m)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="fruits"></param>
 22    /// <param name="baskets"></param>
 23    /// <returns></returns>
 24    public int NumOfUnplacedFruits(int[] fruits, int[] baskets)
 225    {
 226        var unplacedFruitsCount = fruits.Length;
 27
 1828        foreach (var fruit in fruits)
 629        {
 2630            for (var j = 0; j < baskets.Length; j++)
 1231            {
 1232                if (fruit > baskets[j])
 733                {
 734                    continue;
 35                }
 36
 537                baskets[j] = 0;
 38
 539                unplacedFruitsCount--;
 40
 541                break;
 42            }
 643        }
 44
 245        return unplacedFruitsCount;
 246    }
 47}