代码随想录day10 lc20, 1047, 150

20. Valid Parentheses
    https://leetcode.cn/problems/valid-parentheses/

class Solution {
public:
    bool isValid(string s) {
        stack<char>st;
        for (auto x: s) {
            if (x == '(' || x == '[' || x == '{') {
            	// 或者push相反的符号，pop时看是不是和当前字符相同 
                st.push(x);
            } else if (x == ')') {
                if (st.empty() || st.top() != '(') {
                    return false;
                }
                st.pop();
            } else if (x == ']') {
                if (st.empty() || st.top() != '[') {
                    return false;
                }
                st.pop();
            } else {
                if (st.empty() || st.top() != '{') {
                    return false;
                }
                st.pop();
            }
        }
        return st.empty();
    }
};

1047. Remove All Adjacent Duplicates In String
      https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/

class Solution {
public:
    string removeDuplicates(string s) {
        stack<char>st;
        for (auto x: s) {
            if (!st.empty() && x == st.top()) {
                st.pop();
            } else {
                st.push(x);
            }
        }
        string str = "";
        while (!st.empty()) {
            str += st.top();
            st.pop();
        }
        reverse(str.begin(), str.end());
        return str;
    }
};

拿字符串直接作为栈，省去了栈还要转为字符串的操作

class Solution {
public:
    string removeDuplicates(string s) {
        string str = "";
        for (auto x: s) {
            if (str.empty() || x != str.back()) {
                str += x;
            } else {
                str.pop_back();
            }
        }
        return str;
    }
};

150. Evaluate Reverse Polish Notation
     https://leetcode.cn/problems/evaluate-reverse-polish-notation/
     逆波兰表达式是用后序遍历的方式把二叉树序列化

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int>st;
        for (auto x: tokens) {
            if (x == "+" || x == "-" || x == "*" || x == "/") {
                int a = st.top();
                st.pop();
                int b = st.top();
                st.pop();
                if (x == "+") {
                    st.push(a + b);
                } else if (x == "-") {
                    st.push(b - a);
                } else if (x == "*") {
                    st.push(a * b);
                } else  {
                    st.push(b / a);
                } 
            } else {
                st.push(stoi(x));
            }
        }
        return st.top();
    }
};