347.前 K 个高频元素 239. 滑动窗口最大值
滑动窗口最大值
class MyDqueue
{
public:
deque<int> dq;
void pop(int val)
{
if (!dq.empty() && dq.front() == val)
dq.pop_front();
}
void push(int val)
{
while(!dq.empty() && dq.back() < val)
{
dq.pop_back();
}
dq.push_back(val);
}
int getMaxValue()
{
return dq.front();
}
};
vector<int> maxSlidingWindow(vector<int>& nums, int k)
{
MyDqueue myDq;
vector<int> res;
for (int i = 0; i < k; i++)
{
myDq.push(nums[i]);
}
res.push_back(myDq.getMaxValue());
for (int i = k; i < nums.size(); i++)
{
myDq.pop(nums[i - k]);
myDq.push(nums[i]);
res.push_back(myDq.getMaxValue());
}
return res;
}
前 K 个高频元素
class myCMP
{
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 (auto i = 0; i < nums.size(); i++)
map[nums[i]]++;
priority_queue<pair<int, int>, vector<pair<int, int>>, myCMP> pri_qu;
for (unordered_map<int, int>::iterator it = map.begin(); it != map.end(); it++)
{
pri_qu.push(*it);
if (pri_qu.size() > k)
{
pri_qu.pop();
}
}
vector<int> res(k);
for (int i = k - 1; i >= 0; i--)
{
res[i] = pri_qu.top().first;
pri_qu.pop();
}
return res;
}