int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize){
*returnSize = numsSize - k + 1;
int *res = (int *) malloc( (*returnSize) * sizeof(int) );
int dequeue[numsSize] ; /*单调递减队列*/
int head =0, tail=0; /*head为能使用的队列的队头, tail为队尾*/
int i = 0, tmp = 0;
for(i=0; i< numsSize; i++){
tmp = nums[i];
/*保障队列中是递减的,若新的元素大于前边的元素,则删除前边元素*/
while ( tail > head && tmp > dequeue[tail-1] ){ /*特别注意&&前后两个条件顺序不能变,否则提示下标越界*/
--tail;
}
dequeue[tail++] = tmp;
/*每次弹出最大值即队头元素*/
if(i >= k-1){
res[i-k+1] = dequeue[head];
/*当队头元素等于nums[i-k+1]时,说明队头元素要出滑动窗了,队头元素要出队*/
if(dequeue[head] == nums[i-k+1]){
head++;
}
}
}
return res;
}