| | 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 | |
|
| | 12 | | namespace LeetCode.Algorithms.RemoveElement; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public 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) |
| 2 | 25 | | { |
| 28 | 26 | | for (var k = 0; k < nums.Length; k++) |
| 12 | 27 | | { |
| 184 | 28 | | for (var i = 0; i < nums.Length; i++) |
| 80 | 29 | | { |
| 80 | 30 | | if (nums[i] != val) |
| 46 | 31 | | { |
| 46 | 32 | | continue; |
| | 33 | | } |
| | 34 | |
|
| 146 | 35 | | for (var j = i; j < nums.Length - 1; j++) |
| 39 | 36 | | { |
| 39 | 37 | | (nums[j], nums[j + 1]) = (nums[j + 1], nums[j]); |
| 39 | 38 | | } |
| 34 | 39 | | } |
| 12 | 40 | | } |
| | 41 | |
|
| 14 | 42 | | return nums.Count(num => !num.Equals(val)); |
| 2 | 43 | | } |
| | 44 | | } |