代码随想录算法训练营第12天

LeetCode 150.逆波兰表达式求值

链接

class Solution {
public:
    int evalRPN(vector<string>& tokens) {
        stack<int> s;
        for(int i = 0; i < tokens.size(); i++) {
            if(tokens[i] == "+" || tokens[i] == "-" || tokens[i] == "*" || tokens[i] == "/") {  // 算符
                int num1 = s.top();
                s.pop();
                int num2 = s.top();
                s.pop();
                int res = operating(tokens[i], num2, num1);
                s.push(res);
            } else {    // 数字 
                s.push(stoi(tokens[i]));
            }
        }
        int res = s.top();
        s.pop();
        return res;
    }

    int operating(string op, int num1, int num2) {
        int res;
        if(op == "+") {
            res = num1 + num2;
        }
        if(op == "-") {
            res = num1 - num2;
        }
        if(op == "*") {
            res = num1 * num2;
        }
        if(op == "/") {
            res = num1 / num2;
        }
        return res;
    }
};

LeetCode 239.滑动窗口最大值

链接

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

        }
        
        int front() {
            return que.front();
        }
    };
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;
    }
};

LeetCode 347.前k个高频元素

链接

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

public:
    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>>, mycomparison> pri_que;
        for(auto it : map) {
            pri_que.push(it);
            if(pri_que.size() > k) {
                pri_que.pop();
            }
        }

        vector<int> result(k);
        for(int i = k - 1; i >= 0; i--) {
            result[i] = pri_que.top().first;
            pri_que.pop();
        }
        return result;
    }
};