439. Ternary Expression Parser

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"

方法1: stack

思路：

首先确定需要按照什么顺序来eval？只有当后面’:'前后都是单独的数字的时候才能

class Solution {
public:
    string parseTernary(string expression) {
        stack<int> st;
        string res = expression;
        
        for (int i = 0; i < expression.size(); i++) {
            if (expression[i] == '?') st.push(i);
        }
        while (!st.empty()) {
            auto i = st.top();
            st.pop();
            
            res = res.substr(0, i - 1) + eval(res.substr(i - 1, 5)) + res.substr(i + 4);
        }
        return res;
    }
    
    string eval(string s) {
        //if (s.size() != 5) return "";
        return s[0] == 'T' ? s.substr(2, 1) : s.substr(4);
    }
};

discussion: https://leetcode.com/problems/ternary-expression-parser/discuss/92241/C%2B%2B-5-lines
和上面的思想一样，运用了find_last_of的内置函数找到最后一次出现？的位置，并且开始从后向前parse。总体的出循环时间是expression.size() > 1。

class Solution {
public:
    string parseTernary(string expression) {
        string res = expression;
        while (res.size() > 1) {
            int i = res.find_last_of("?");
            res = res.substr(0, i - 1) + string(1, res[i - 1] == 'T' ? res[i + 1] : res[i + 3]) + res.substr(i + 4);
        }
        return res;
    }
};