| | | 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.ParsingBooleanExpression; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class ParsingBooleanExpressionRecursive : IParsingBooleanExpression |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="expression"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public bool ParseBoolExpr(string expression) |
| | 12 | 24 | | { |
| | 12 | 25 | | if (expression.Length == 1) |
| | 7 | 26 | | { |
| | 7 | 27 | | return expression == "t"; |
| | | 28 | | } |
| | | 29 | | |
| | 5 | 30 | | var operation = expression[0]; |
| | | 31 | | |
| | 5 | 32 | | if (operation == '!') |
| | 1 | 33 | | { |
| | 1 | 34 | | return !ParseBoolExpr(expression.Substring(2, expression.Length - 3)); |
| | | 35 | | } |
| | | 36 | | |
| | 4 | 37 | | var result = operation == '&'; |
| | | 38 | | |
| | 4 | 39 | | var level = 0; |
| | 4 | 40 | | var start = 2; |
| | | 41 | | |
| | 46 | 42 | | for (var i = start; i < expression.Length; i++) |
| | 19 | 43 | | { |
| | 19 | 44 | | var character = expression[i]; |
| | | 45 | | |
| | 19 | 46 | | switch (character) |
| | | 47 | | { |
| | | 48 | | case '(': |
| | 1 | 49 | | level++; |
| | 1 | 50 | | break; |
| | | 51 | | case ')': |
| | 5 | 52 | | level--; |
| | 5 | 53 | | break; |
| | | 54 | | } |
| | | 55 | | |
| | 19 | 56 | | if ((character != ',' || level != 0) && (character != ')' || level != -1)) |
| | 11 | 57 | | { |
| | 11 | 58 | | continue; |
| | | 59 | | } |
| | | 60 | | |
| | 8 | 61 | | var subExpression = expression.Substring(start, i - start); |
| | 8 | 62 | | var subResult = ParseBoolExpr(subExpression); |
| | | 63 | | |
| | 8 | 64 | | switch (operation) |
| | | 65 | | { |
| | | 66 | | case '&': |
| | 3 | 67 | | result &= subResult; |
| | 3 | 68 | | break; |
| | | 69 | | case '|': |
| | 5 | 70 | | result |= subResult; |
| | 5 | 71 | | break; |
| | | 72 | | } |
| | | 73 | | |
| | 8 | 74 | | start = i + 1; |
| | 8 | 75 | | } |
| | | 76 | | |
| | 4 | 77 | | return result; |
| | 12 | 78 | | } |
| | | 79 | | } |