栈问题合集

class Solution {
public:
    string reverseParentheses(string s) {
        //u evol i    ed et oc    etco   octe    edocteel leetcode
        stack<string> st;
       
        string str;
        for(auto& ch : s){
            if(ch == '('){
                st.push(str);
                str = "";
            }
            else if(ch == ')'){
                reverse(str.begin(), str.end());
                str = st.top() + str;  //u evol
                st.pop();
            }
            else
                str += ch; //u evol i
        }

        return str;
    }
};

class Solution {
public:
    string decodeString(string s) {
        string str;
    
        stack<int> stNum;
        stack<string> st;
        int num = 0;

        for(auto& ch : s){
        		//3[a2[c]]    stNum 3 2  st "a"  
        		//str = "c"      cc
            if(ch >= '0' && ch <= '9'){
                num = num * 10 + (ch - '0');
            }
            else if(ch == '['){
                stNum.push(num);
                num = 0;

                st.push(str);
                str = "";
            }
            else if(ch == ']'){
                int n = stNum.top();
                stNum.pop();
                
                while(n >= 1){  //ac = a +c  acc=ac + c
                    st.top() += str;
                    n--;
                }
                str = st.top();  //str = acc;
                st.pop();
            }
            else
                str += ch;
            
        }
        return str;
    }
};

与1047. 删除字符串中的所有相邻重复项解法相似

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> st;
        int num = 0;
        
        for(int i = 0; i < tokens.size(); i++){
            if(tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/"){
                int num1 = st.top();
                st.pop();
                int 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(stoi(tokens[i]));
        }

        int res = st.top();
        st.pop();

        return res;
    }
};