| | | 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 | | using System.Text; |
| | | 13 | | |
| | | 14 | | namespace LeetCode.Algorithms.MinimumRemoveToMakeValidParentheses; |
| | | 15 | | |
| | | 16 | | /// <inheritdoc /> |
| | | 17 | | public class MinimumRemoveToMakeValidParenthesesStack : IMinimumRemoveToMakeValidParentheses |
| | | 18 | | { |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n) |
| | | 21 | | /// Space complexity - O(n) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="s"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public string MinRemoveToMakeValid(string s) |
| | 3 | 26 | | { |
| | 3 | 27 | | var removeIndices = new HashSet<int>(); |
| | 3 | 28 | | var stack = new Stack<int>(); |
| | | 29 | | |
| | 54 | 30 | | for (var i = 0; i < s.Length; i++) |
| | 24 | 31 | | { |
| | 24 | 32 | | switch (s[i]) |
| | | 33 | | { |
| | | 34 | | case '(': |
| | 5 | 35 | | stack.Push(i); |
| | 5 | 36 | | break; |
| | 7 | 37 | | case ')' when stack.Count > 0: |
| | 3 | 38 | | stack.Pop(); |
| | 3 | 39 | | break; |
| | | 40 | | case ')': |
| | 4 | 41 | | removeIndices.Add(i); |
| | 4 | 42 | | break; |
| | | 43 | | } |
| | 24 | 44 | | } |
| | | 45 | | |
| | 5 | 46 | | while (stack.Count > 0) |
| | 2 | 47 | | { |
| | 2 | 48 | | removeIndices.Add(stack.Pop()); |
| | 2 | 49 | | } |
| | | 50 | | |
| | 3 | 51 | | var resultBuilder = new StringBuilder(); |
| | | 52 | | |
| | 54 | 53 | | for (var i = 0; i < s.Length; i++) |
| | 24 | 54 | | { |
| | 24 | 55 | | if (!removeIndices.Contains(i)) |
| | 18 | 56 | | { |
| | 18 | 57 | | resultBuilder.Append(s[i]); |
| | 18 | 58 | | } |
| | 24 | 59 | | } |
| | | 60 | | |
| | 3 | 61 | | return resultBuilder.ToString(); |
| | 3 | 62 | | } |
| | | 63 | | } |