代码随想录算法训练营第十二天|150.逆波兰表达式求值、239.滑动窗口最大值、347.前k个高频元素

150.逆波兰表达式求值

学到了' '是char, " "是string。代码如下：

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        int num1;
        int num2;
        int result;
        stack<int> myStack;
        for(int i = 0; i < tokens.size(); i++){
            if(tokens[i] == "+"){
                num2 = myStack.top();
                myStack.pop();
                num1 = myStack.top();
                myStack.pop();
                result = num1 + num2;
                myStack.push(result);
            }
            else if(tokens[i] == "-"){
                num2 = myStack.top();
                myStack.pop();
                num1 = myStack.top();
                myStack.pop();
                result = num1 - num2;
                myStack.push(result);
            }
            else if(tokens[i] == "*"){
                num2 = myStack.top();
                myStack.pop();
                num1 = myStack.top();
                myStack.pop();
                result = num1 * num2;
                myStack.push(result);
            }
             else if(tokens[i] == "/"){
                num2 = myStack.top();
                myStack.pop();
                num1 = myStack.top();
                myStack.pop();
                result = num1 / num2;
                myStack.push(result);
            }
            else{
                myStack.push(stoi(tokens[i]));
            }
        }
        return myStack.top();
    }
};

239.滑动窗口最大值

看了题解终于弄懂了。学到了deque。

代码如下：

class MyQueue{
public:
    deque<int> que;
    void push(int num){
        while(!que.empty() && num > que.back()){
            que.pop_back();
        }
        que.push_back(num);
    }
    void pop(int value){
        if(!que.empty() && value == que.front()) que.pop_front();
    }
    int front(){
        return que.front();
    }
};

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k){
        MyQueue que;
        vector<int> result;
        for(int i = 0; i < k; i++){
            que.push(nums[i]);
        }
        result.push_back(que.front());
        for(int i = k; i < nums.size(); i++){
            que.pop(nums[i - k]);
            que.push(nums[i]);
            result.push_back(que.front());
        }
        return result;
    }
};

347.前k个高频元素

没学过大顶堆，感觉看起来挺费劲。看懂之后抄了下题解，学了后再重做。代码如下：

class Solution {
public:
    class MyComparition{
    public: 
      bool operator()(const pair<int, int> &lhs, const pair<int, int> &rhs){
        return lhs.second > rhs.second;
      }  
    };

    vector<int> topKFrequent(vector<int>& nums, int k) {
        unordered_map<int, int> myMap;
        for(int i = 0; i < nums.size(); i++){
            myMap[nums[i]]++;
        }
        priority_queue<pair<int, int>, vector<pair<int, int>>, MyComparition> priQue;
        for(unordered_map<int, int>::iterator it = myMap.begin(); it != myMap.end(); it++){
            priQue.push(*it);
            if(priQue.size() > k)
                priQue.pop();
        }
        vector<int> result(k);
        for(int i = k - 1; i >= 0; i--){
            result[i] = priQue.top().first;
            priQue.pop();
        }
        return result;
    }
};