239 滑动窗口最大值
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
vector<int> result;
deque<int> window;
int n = nums.size();
for (int i = 0; i < n; ++i) {
if (!window.empty() && window.front() == i - k)
window.pop_front();
while (!window.empty() && nums[i] >= nums[window.back()])
window.pop_back();
window.push_back(i);
if (i >= k - 1)
result.push_back(nums[window.front()]);
}
return result;
}
};
347前k个高频元素
class Solution {
public:
vector<int> topKFrequent(vector<int>& nums, int k) {
unordered_map<int, int> freqMap;
for (int num : nums) {
freqMap[num]++;
}
auto cmp = [](const pair<int, int>& a, const pair<int, int>& b) {
return a.second < b.second;
};
priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(cmp)> pq(cmp);
for (auto& entry : freqMap) {
pq.push(entry);
}
vector<int> result;
for (int i = 0; i < k; ++i) {
result.push_back(pq.top().first);
pq.pop();
}
return result;
}
};