| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.MinimumOperationsToConvertAllElementsToZero; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MinimumOperationsToConvertAllElementsToZeroStackAsSpan : IMinimumOperationsToConvertAllElementsToZer |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MinOperations(int[] nums) |
| | 3 | 24 | | { |
| | 3 | 25 | | Span<int> numsSpan = stackalloc int[nums.Length]; |
| | | 26 | | |
| | 3 | 27 | | var numsSpanCount = 0; |
| | | 28 | | |
| | 3 | 29 | | var minOperations = 0; |
| | | 30 | | |
| | 33 | 31 | | foreach (var num in nums) |
| | 12 | 32 | | { |
| | 16 | 33 | | while (numsSpanCount > 0 && numsSpan[numsSpanCount - 1] > num) |
| | 4 | 34 | | { |
| | 4 | 35 | | numsSpan[numsSpanCount--] = 0; |
| | 4 | 36 | | } |
| | | 37 | | |
| | 12 | 38 | | if (num == 0) |
| | 1 | 39 | | { |
| | 1 | 40 | | continue; |
| | | 41 | | } |
| | | 42 | | |
| | 11 | 43 | | if (numsSpanCount > 0 && numsSpan[numsSpanCount - 1] >= num) |
| | 3 | 44 | | { |
| | 3 | 45 | | continue; |
| | | 46 | | } |
| | | 47 | | |
| | 8 | 48 | | numsSpan[numsSpanCount++] = num; |
| | | 49 | | |
| | 8 | 50 | | minOperations++; |
| | 8 | 51 | | } |
| | | 52 | | |
| | 3 | 53 | | return minOperations; |
| | 3 | 54 | | } |
| | | 55 | | } |