239. 滑动窗口最大值
题目:Leetcode
文档:代码随想录
视频:B站视频
class Solution {
private:
class MyQueue
{
public:
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;
}
};
347.前 K 个高频元素
题目:Leetcode
文档:代码随想录
视频:B站视频
class Solution {
public:
class mycomparison
{
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> 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 (unordered_map<int, int>::iterator it = map.begin(); it != map.end(); it++)
{
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;
}
};