题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,[4,2,6],2,5,1}, {2,3,4,[2,6,2],5,1}, {2,3,4,2,[6,2,5],1}, {2,3,4,2,6,[2,5,1]}。
解题思路
双端队列好,只存下标好。
Code
class Solution {
public:
vector<int> maxInWindows(const vector<int>& num, unsigned int size)
{
vector<int> maxWindows;
deque<int> index;
if(num.size() >= size && size >= 1) {
for(unsigned int i = 0; i<size; i++) {
while(!index.empty() && num[index.back()] <= num[i])
index.pop_back();
index.push_back(i);
}
for(unsigned int i = size; i<num.size(); i++) {
maxWindows.push_back(num[index.front()]);
while(!index.empty() && num[index.back()] <= num[i])
index.pop_back();
if(!index.empty() && i-index.front() >= size) {
index.pop_front();
}
index.push_back(i);
}
maxWindows.push_back(num[index.front()]);
}
return maxWindows;
}
};
- 第二次终于自己写出来了,虽然过程很艰辛。。
import java.util.LinkedList;
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> maxInWindows(int [] num, int size)
{
ArrayList<Integer> result = new ArrayList<Integer>();
int len = num.length;
if(len >= size && size > 0) {
LinkedList<Integer> list = new LinkedList<Integer>();
for(int i = 0; i<size; i++) {
while(!list.isEmpty() && num[list.getLast()] <= num[i]) list.removeLast();
list.add(i);
}
for(int i = size; i<len; i++) {
result.add(num[list.peek()]);
if(!list.isEmpty() && i-list.peek() > size-1) list.pop();
while(!list.isEmpty() && num[list.getLast()] <= num[i]) {
list.removeLast();
}
list.add(i);
}
result.add(num[list.peek()]);
}
return result;
}
}