fork download
  1. #include <iostream>
  2. #include <vector>
  3. #include <deque>
  4. using namespace std;
  5. class Solution {
  6. public:
  7. vector<int> maxSlidingWindow(vector<int>& nums, int k) {
  8. deque<int> dq;
  9. vector<int> res;
  10. for(int i = 0; i < nums.size(); i++) {
  11. if (dq.front() == i - k) dq.pop_front();
  12. while (!dq.empty() && nums[dq.back()] < nums[i]) {
  13. dq.pop_back();
  14. }
  15. dq.push_back(i);
  16. if (i >= k - 1) res.push_back(nums[dq.front()]);
  17. }
  18. return res;
  19. }
  20. };
  21. int main() {
  22. Solution solution;
  23. vector<int> nums = {1, 3, -1, -3, 5, 3, 6, 7};
  24. int k = 3;
  25. vector<int> result = solution.maxSlidingWindow(nums, k);
  26. for (int i = 0; i < result.size(); i++) {
  27. cout << result[i] << " ";
  28. }
  29. cout << endl;
  30. return 0;
  31. }
  32.  
Success #stdin #stdout 0s 5296KB
stdin
Standard input is empty
stdout
3 3 5 5 6 7