< Summary

Information
Class: LeetCode.Algorithms.FinalPricesWithSpecialDiscountInShop.FinalPricesWithSpecialDiscountInShopBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FinalPricesWithSpecialDiscountInShop\FinalPricesWithSpecialDiscountInShopBruteForce.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
Total lines: 42
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
FinalPrices(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FinalPricesWithSpecialDiscountInShop\FinalPricesWithSpecialDiscountInShopBruteForce.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.FinalPricesWithSpecialDiscountInShop;
 13
 14/// <inheritdoc />
 15public class FinalPricesWithSpecialDiscountInShopBruteForce : IFinalPricesWithSpecialDiscountInShop
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="prices"></param>
 22    /// <returns></returns>
 23    public int[] FinalPrices(int[] prices)
 324    {
 2825        for (var i = 0; i < prices.Length - 1; i++)
 1126        {
 4827            for (var j = i + 1; j < prices.Length; j++)
 1828            {
 1829                if (prices[j] > prices[i])
 1330                {
 1331                    continue;
 32                }
 33
 534                prices[i] -= prices[j];
 35
 536                break;
 37            }
 1138        }
 39
 340        return prices;
 341    }
 42}

Methods/Properties

FinalPrices(System.Int32[])