代码随想录-栈和队列

预备知识

coding

day10

• 232. 用栈实现队列
  

class MyQueue {
public:
    MyQueue() {}
    void push(int x) {
        in.push(x);
    }
    int pop() {
        if(out.empty()){
            while(!in.empty()){
            	out.push(in.top());
            	in.pop();
        	}
        }
        int val = out.top();
        out.pop();
        return val;
    }
    
    int peek() {
        if(out.empty()){
            while(!in.empty()){
            out.push(in.top());
            in.pop();
        }
        }
        return out.top();
    }
    
    bool empty() {
        return in.empty() && out.empty();
    }

    std::stack<int> in;
    std::stack<int> out;
};

• 225. 用队列实现栈
  last中存储的是已经符合条件的序列，每次入队列时，需要将这部分数据重新追加到新入数据的尾部，保证最新数据最先出队列

class MyStack {
public:
    MyStack() {}
    
    void push(int x) {
        cur->push(x);
        while(!last->empty()){
            cur->push(last->front());
            last->pop();
        }
        auto* tmp = last;
        last = cur;
        cur = tmp;
    }
    
    int pop() {
        int val = last->front();
        last->pop();
        return val;
    }
    
    int top() {
        return last->front();
    }
    
    bool empty() {
        return in.empty() && out.empty();
    }

    std::queue<int> in;
    std::queue<int> out;

    std::queue<int>* cur = &in;    // 本次应该操作的栈
    std::queue<int>* last = &out;    // 上次操作完的栈
};

day11

• 1047. 删除字符串中的所有相邻重复项
  

    string removeDuplicates(string s) {
        std::stack<char> st;
        std::string ret;
        for(char c : s){
            if(st.empty() || c != st.top()){
                st.push(c);
                ret.push_back(c);
                continue;
            }
            while( !st.empty() && c == st.top()){
                st.pop();
                ret.pop_back();
            }
        }
        return ret;
    }
	// 可以去除栈
    string removeDuplicates(string s) {
        std::string ret;
        for(char c : s){
            if(ret.empty() || c != ret.back()){
                ret.push_back(c);
                continue;
            }
            while( !ret.empty() && c == ret.back()){
                ret.pop_back();
            }
        }
        return ret;
    }

• 150. 逆波兰表达式求值
  

    std::unordered_set<std::string> kMap{"+", "-", "*", "/"};

    std::stack<int> st;
    int evalRPN(vector<string>& tokens) {
        for(const std::string& ele : tokens){
            if(st.empty() || kMap.count(ele) == 0){
                st.push(std::atoi(ele.c_str()));
                continue;
            }
            int val2 = st.top();
            st.pop();
            int val1 = st.top();
            st.pop();

            int val;
            if(ele == "+"){
                val = val1 + val2;
            }else if(ele == "-"){
                val = val1 - val2;
            }else if(ele == "*"){
                val = val1 * val2;
            }else if(ele == "/"){
                val = val1 / val2;
            }
            st.push(val);
        }

        return st.top();
    }

day13

• 239. 滑动窗口最大值

    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        std::deque<int> dq;

        for(int index = 0; index < k ;++index){
            while(!dq.empty() && nums[index] > nums[dq.back()]){
                dq.pop_back();
            }
            dq.push_back(index);
        }
        vector<int> ret{nums[dq.front()]};

        for(int index = k ; index < nums.size(); ++index){
            // 当前元素大于前面的元素，则可以安全删除前面的元素
             while(!dq.empty() && nums[index] > nums[dq.back()]){
                dq.pop_back();
            }
            dq.push_back(index);

            // 限制k窗口
            while(dq.front() <= index -k){
                dq.pop_front();
            }

            ret.push_back(nums[dq.front()]);
        }
        return ret;
    }

• 347. 前 K 个高频元素

    vector<int> topKFrequent(vector<int>& nums, int k) {
        using Element = std::pair<int, int>;
        auto cmp = [](const Element& left , const Element& right){
            return left.second < right.second;
        };
        std::priority_queue<Element, std::vector<Element>, decltype(cmp)> q(cmp);

        std::unordered_map<int, int> records;
        for(auto ele : nums){
            records[ele]++;
        }

        for(auto itr : records){
            q.push(itr);
        }

        vector<int> ret;
        while(k-- && !q.empty()){
            ret.push_back(q.top().first);
            q.pop();
        }

        return ret;
    }