算法训练营day13

题目部分

239.滑动窗口最大值

hard题还是有点难的

class Solution {
public:
    class MyQueue{
        public:
        deque<int> que;
        void pop(int val){
            if(!que.empty()&& val == que.front()){
                que.pop_front();
            }
        }

        void push(int val){
            while(!que.empty()&&que.back()<val)que.pop_back();
            que.push_back(val);
        }
        int front(){
            return que.front();
        }
    };
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        MyQueue que;
        vector<int> result;
        for(int i = 0;i<k;i++){
            que.push(nums[i]);
        }
        for(int i = k;i<nums.size();i++){
            result.push_back(que.front());
            que.pop(nums[i-k]);
            que.push(nums[i]);
        }
        result.push_back(que.front());
        return result;
    }
};

347.前k个高频元素

class Solution {
public:
    class mycompare{
        public:
        bool operator()(const pair<int,int>&a,const pair<int,int>&b){
            return a.second>b.second;
        }
    };
    vector<int> topKFrequent(vector<int>& nums, int k) {
        unordered_map<int,int> map;
        for(int i = 0;i<nums.size();i++){
            map[nums[i]]++;
        }

        priority_queue<pair<int,int>,vector<pair<int,int>>,mycompare> pri_que;

        for(auto it = map.begin();it!=map.end();it++){
            pri_que.push(*it);
            if(pri_que.size()>k)pri_que.pop();
        }
        vector<int>result;
        while(!pri_que.empty()){
            result.emplace_back(pri_que.top().first);
            pri_que.pop();
        }
        return result;
    }
};