Day 11

碰碰狗

已于 2024-09-10 23:49:42 修改

阅读量220

点赞数 2

分类专栏：代码随想录算法训练营45期文章标签： leetcode 数据结构算法

于 2024-09-09 23:55:14 首次发布

本文链接：https://blog.csdn.net/suitaox26456/article/details/142070894

版权

代码随想录算法训练营45期专栏收录该内容

11 篇文章 0 订阅

订阅专栏

150. 逆波兰表达式求值

class Solution
{
public:
    int evalRPN(vector<string>& tokens)
    {
        stack<int> s;

        for (auto& token : tokens)
        {
            if (token == "+" || token == "-" || token == "*" || token == "/")
            {
                int num1, num2;

                num2 = s.top();
                s.pop();
                num1 = s.top();
                s.pop();

                if (token == "+")
                {
                    s.push(num1 + num2);
                }
                else if (token == "-")
                {
                    s.push(num1 - num2);
                }
                else if (token == "*")
                {
                    s.push(num1 * num2);
                }
                else
                {
                    s.push(num1 / num2);
                }
            }
            else
            {
                s.push(stoi(token));
            }
        }

        return s.top();
    }
};

239. 滑动窗口最大值

class Solution
{
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k)
    {
        int left{ 0 }, right{ k - 1 };
        priority_queue<pair<int, int>> heap;
        vector<int> ans;


        for (int i = left; i <= right; i++)
        {
            heap.emplace(nums[i], i);
        }

        ans.push_back(heap.top().first);
        left++;
        right++;

        while (right < nums.size())
        {
            heap.emplace(nums[right], right);
            auto temp{ heap.top() };

            while (temp.second < left)
            {
                heap.pop();
                temp = heap.top();
            }
            ans.push_back(temp.first);
            left++;
            right++;
        }

        return ans;
    }
};

347. 前 K 个高频元素

class Solution
{
public:
    vector<int> topKFrequent(vector<int>& nums, int k)
    {
        auto cmp = [](pair<int, int>left, pair<int, int>right)->bool {return left.second > right.second; };
        priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(cmp)> heap(cmp);
        unordered_map<int, int> map;
        vector<int> ans;

        for (auto& num : nums)
        {
            map[num]++;
        }

        for (auto& m : map)
        {
            if (heap.size() < k)
            {
                heap.emplace(m.first, m.second);
            }
            else
            {
                if (m.second > heap.top().second)
                {
                    heap.pop();
                    heap.emplace(m.first, m.second);
                }
            }
        }

        while (!heap.empty())
        {
            ans.push_back(heap.top().first);
            heap.pop();
        }

        return ans;
    }
};