day11-栈与队列part02

栈与队列part02

---

一、20.有效的括号

class Solution {
public:
    bool isValid(string s) {
        if(s.size() % 2 != 0)return false;
        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) {
        string result;
        for(char s : s){
            if(result.empty() || result.back() != s){
                result.push_back(s);
            }else{
                result.pop_back();
            }
        }
        return result;
    }
};

三、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 result = st.top();
        st.pop();
        return result;
    }
};

---

总结

再接再厉，拒绝abandon