LeetCode：239. 滑动窗口最大值

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize){
    //初始化一个数组队列
    int queue[numsSize];
    int left = 0,right = 0;
    //将前k个元素按单调递减的顺序入队列
    for(int i = 0;i < k;i++){
        while((right > left) && (nums[i] > nums[queue[right - 1]])){
            right--;
        }
        queue[right++] = i;
    }
    //定义一个返回数组
    *returnSize = 0;
    int *ret = (int*)calloc(numsSize-k+1,sizeof(int));
    //放入最大元素
    ret[(*returnSize)++] = nums[queue[left]];
    //移动窗口，并将新元素放入队列的同时满足队列的单调性
    for(int i = k;i < numsSize;i++){
        while((right > left) && (nums[i] > nums[queue[right - 1]])){
            right--;
        }
        queue[right++] = i;
        //判断最大元素位置
         while(queue[left] <= (i-k)){
            left++;
        }
        ret[(*returnSize)++] = nums[queue[left]];
    }
    return ret;
}