Leetcode 439. Ternary Expression Parser (递归，栈)

最新推荐文章于 2022-11-15 12:36:01 发布

快乐的小鸟-ZJU

最新推荐文章于 2022-11-15 12:36:01 发布

阅读量2k

点赞数 1

文章标签：算法 leetcode

本文链接：https://blog.csdn.net/zqh_1991/article/details/52901605

版权

Given a string representing arbitrarily nested ternary expressions, calculate the result of the expression. You can always assume that the given expression is valid and only consists of digits 0-9, ?, :, T and F (T and F represent True and False respectively).

Note:

The length of the given string is ≤ 10000.
Each number will contain only one digit.
The conditional expressions group right-to-left (as usual in most languages).
The condition will always be either T or F. That is, the condition will never be a digit.
The result of the expression will always evaluate to either a digit 0-9, T or F.

Example 1:

Input: "T?2:3"

Output: "2"

Explanation: If true, then result is 2; otherwise result is 3.

Example 2:

Input: "F?1:T?4:5"

Output: "4"

Explanation: The conditional expressions group right-to-left. Using parenthesis, it is read/evaluated as:

             "(F ? 1 : (T ? 4 : 5))"                   "(F ? 1 : (T ? 4 : 5))"
          -> "(F ? 1 : 4)"                 or       -> "(T ? 4 : 5)"
          -> "4"                                    -> "4"

Example 3:

Input: "T?T?F:5:3"

Output: "F"

Explanation: The conditional expressions group right-to-left. Using parenthesis, it is read/evaluated as:

             "(T ? (T ? F : 5) : 3)"                   "(T ? (T ? F : 5) : 3)"
          -> "(T ? F : 3)"                 or       -> "(T ? F : 5)"
          -> "F"                                    -> "F"

题解：栈，递归。

class Solution {
public:
    string parseTernary(string expression) {
        int len=expression.size();
        if(len==1) return expression;
        int count1=0,count2=0;
        for(int i=0;i<len;i++) {
            if(expression[i]=='?') {
                count1++;
            }
            else if(expression[i]==':') {
                count2++;
                if(count1==count2) {
                    if(expression[0]=='T') {
                        return parseTernary(expression.substr(2,i-2));  //表达式的左边
                    }
                    else return parseTernary(expression.substr(i+1));   //表达式的右边
                }
            }
        }
        return "";
    }
};