René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"leetcode239：滑动窗口最大值问题","articleBody":"给定一个数组 `nums` 和滑动窗口的大小 `k`，请找出所有滑动窗口里的最大值。\r\n\r\n**示例:**\r\n\r\n```js\r\n输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3\r\n输出: [3,3,5,5,6,7] \r\n```\r\n\r\n**解释:** \r\n\r\n\u003e 滑动窗口的位置                最大值\r\n\u003e\r\n\u003e [1  3  -1] -3  5  3  6  7       3\r\n\u003e  1 [3  -1  -3] 5  3  6  7       3\r\n\u003e  1  3 [-1  -3  5] 3  6  7       5\r\n\u003e  1  3  -1 [-3  5  3] 6  7       5\r\n\u003e  1  3  -1  -3 [5  3  6] 7       6\r\n\u003e  1  3  -1  -3  5 [3  6  7]      7\r\n\r\n\r\n**提示：**\r\n\r\n你可以假设 `k` 总是有效的，在输入数组不为空的情况下，1 ≤ k ≤ 输入数组的大小。\r\n\r\n附赠leetcode地址：[leetcode](https://leetcode-cn.com/problems/sliding-window-maximum/solution/javascriptjie-leetcodehua-dong-chuang-kou-zui-da-z/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-05-06T13:10:27.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":12},"url":"https://github.com/33/JavaScript-Algorithms/issues/33"}