| | | 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.CheckIfParenthesesStringCanBeValid; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CheckIfParenthesesStringCanBeValidGreedy : ICheckIfParenthesesStringCanBeValid |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <param name="locked"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool CanBeValid(string s, string locked) |
| | 4 | 25 | | { |
| | 4 | 26 | | if (s.Length % 2 == 1) |
| | 1 | 27 | | { |
| | 1 | 28 | | return false; |
| | | 29 | | } |
| | | 30 | | |
| | 3 | 31 | | var openMin = 0; |
| | 3 | 32 | | var openMax = 0; |
| | | 33 | | |
| | 90 | 34 | | for (var i = 0; i < s.Length; i++) |
| | 42 | 35 | | { |
| | 42 | 36 | | if (locked[i] == '0') |
| | 25 | 37 | | { |
| | 25 | 38 | | openMax++; |
| | 25 | 39 | | openMin = Math.Max(0, openMin - 1); |
| | 25 | 40 | | } |
| | 17 | 41 | | else if (s[i] == '(') |
| | 7 | 42 | | { |
| | 7 | 43 | | openMax++; |
| | 7 | 44 | | openMin++; |
| | 7 | 45 | | } |
| | | 46 | | else |
| | 10 | 47 | | { |
| | 10 | 48 | | openMax--; |
| | 10 | 49 | | openMin = Math.Max(0, openMin - 1); |
| | 10 | 50 | | } |
| | | 51 | | |
| | 42 | 52 | | if (openMax < 0) |
| | 0 | 53 | | { |
| | 0 | 54 | | return false; |
| | | 55 | | } |
| | 42 | 56 | | } |
| | | 57 | | |
| | 3 | 58 | | return openMin == 0; |
| | 4 | 59 | | } |
| | | 60 | | } |