< Summary

Information
Class: LeetCode.Algorithms.RemoveElement.RemoveElementBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveElement\RemoveElementBruteForce.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 44
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
RemoveElement(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveElement\RemoveElementBruteForce.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.RemoveElement;
 13
 14/// <inheritdoc />
 15public class RemoveElementBruteForce : IRemoveElement
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^3)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="val"></param>
 23    /// <returns></returns>
 24    public int RemoveElement(int[] nums, int val)
 225    {
 2826        for (var k = 0; k < nums.Length; k++)
 1227        {
 18428            for (var i = 0; i < nums.Length; i++)
 8029            {
 8030                if (nums[i] != val)
 4631                {
 4632                    continue;
 33                }
 34
 14635                for (var j = i; j < nums.Length - 1; j++)
 3936                {
 3937                    (nums[j], nums[j + 1]) = (nums[j + 1], nums[j]);
 3938                }
 3439            }
 1240        }
 41
 1442        return nums.Count(num => !num.Equals(val));
 243    }
 44}