代码随想录栈2

最新推荐文章于 2024-07-25 19:34:38 发布

乌拉！哒哒哒哒哒

最新推荐文章于 2024-07-25 19:34:38 发布

阅读量139

点赞数 2

分类专栏：代码随想录打卡记录文章标签： leetcode c++

本文链接：https://blog.csdn.net/sunke123456789/article/details/136441051

版权

代码随想录打卡记录专栏收录该内容

30 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool isValid(string s) {
        stack<char> st;
        for (int i = 0; i < s.size(); i++) {
            if (s[i] == '(') 
            st.push(')');
            else if (s[i] == '{') 
            st.push('}');
            else if (s[i] == '[') 
            st.push(']');

            else if (st.empty() || st.top() != s[i]) 
            return false;
            else st.pop(); 
        }
        
        return st.empty();
    }
};

1047

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

150

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 res = st.top();
        st.pop(); // 
        return res;

    }
};