| | | 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 MinimumRemoveToMakeValidParenthesesStringBuilder : 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 leftStringBuilder = new StringBuilder(); |
| | | 28 | | |
| | 3 | 29 | | var leftCount = 0; |
| | | 30 | | |
| | 57 | 31 | | foreach (var c in s) |
| | 24 | 32 | | { |
| | 24 | 33 | | switch (c) |
| | | 34 | | { |
| | | 35 | | case ')': |
| | 7 | 36 | | { |
| | 7 | 37 | | if (leftCount > 0) |
| | 3 | 38 | | { |
| | 3 | 39 | | leftCount--; |
| | 3 | 40 | | leftStringBuilder.Append(c); |
| | 3 | 41 | | } |
| | | 42 | | |
| | 7 | 43 | | break; |
| | | 44 | | } |
| | | 45 | | case '(': |
| | 5 | 46 | | leftStringBuilder.Append(c); |
| | | 47 | | |
| | 5 | 48 | | leftCount++; |
| | 5 | 49 | | break; |
| | | 50 | | default: |
| | 12 | 51 | | leftStringBuilder.Append(c); |
| | 12 | 52 | | break; |
| | | 53 | | } |
| | 24 | 54 | | } |
| | | 55 | | |
| | 3 | 56 | | var rightStringBuilder = new StringBuilder(); |
| | | 57 | | |
| | 3 | 58 | | var rightCount = 0; |
| | | 59 | | |
| | 46 | 60 | | for (var i = leftStringBuilder.ToString().Length - 1; i >= 0; i--) |
| | 20 | 61 | | { |
| | 20 | 62 | | switch (leftStringBuilder[i]) |
| | | 63 | | { |
| | | 64 | | case '(': |
| | 5 | 65 | | { |
| | 5 | 66 | | if (rightCount > 0) |
| | 3 | 67 | | { |
| | 3 | 68 | | rightCount--; |
| | 3 | 69 | | rightStringBuilder.Insert(0, leftStringBuilder[i]); |
| | 3 | 70 | | } |
| | | 71 | | |
| | 5 | 72 | | break; |
| | | 73 | | } |
| | | 74 | | case ')': |
| | 3 | 75 | | rightStringBuilder.Insert(0, leftStringBuilder[i]); |
| | | 76 | | |
| | 3 | 77 | | rightCount++; |
| | 3 | 78 | | break; |
| | | 79 | | default: |
| | 12 | 80 | | rightStringBuilder.Insert(0, leftStringBuilder[i]); |
| | 12 | 81 | | break; |
| | | 82 | | } |
| | 20 | 83 | | } |
| | | 84 | | |
| | 3 | 85 | | return rightStringBuilder.ToString(); |
| | 3 | 86 | | } |
| | | 87 | | } |