这个是leetcode239滑动窗口最大值我关于算法的题通过流程图让你快速理解快速记住这个题有助于你快速复习classSolution{publicint[]maxSlidingWindow(int[]nums,intk){DequeIntegerdequenewLinkedList();int[]resultnewint[nums.length-k1];intindex0;for(inti0;inums.length;i){// ① 删除已经滑出窗口的下标while(!deque.isEmpty()deque.peekFirst()i-k){deque.pollFirst();}// ② 删除队尾所有比当前元素小的下标while(!deque.isEmpty()nums[deque.peekLast()]nums[i]){deque.pollLast();}// ③ 当前下标加入队尾deque.offerLast(i);// ④ 窗口形成后记录答案if(ik-1){result[index]nums[deque.peekFirst()];}}returnresult;}}