day 10\11 栈和队列

还算简单，之前略有接触（写的题都是简单题捏）

https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/

class Solution {

public:

    string removeDuplicates(string S)

    {

        string ans;

        for(char s:S)

        {

            if( ans.empty() || s != ans.back())

                ans.push_back(s);

            else

                ans.pop_back();

        }

        return ans;

    }

};

https://leetcode.cn/problems/evaluate-reverse-polish-notation/

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<long long> st; 
        for (int i = 0; i < tokens.size(); i++) {
            if (tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {
                long long num1 = st.top();
                st.pop();
                long long num2 = st.top();
                st.pop();
                if (tokens[i] == "+") st.push(num2 + num1);
                if (tokens[i] == "-") st.push(num2 - num1);
                if (tokens[i] == "*") st.push(num2 * num1);
                if (tokens[i] == "/") st.push(num2 / num1);
            } else {
                st.push(stoll(tokens[i]));
            }
        }

        int result = st.top();
        return result;
    }
};