\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 nums\uff0c\u6709\u4e00\u4e2a\u5927\u5c0f\u4e3a k \u7684\u6ed1\u52a8\u7a97\u53e3\u4ece\u6570\u7ec4\u7684\u6700\u5de6\u4fa7\u79fb\u52a8\u5230\u6570\u7ec4\u7684\u6700\u53f3\u4fa7\u3002\u4f60\u53ea\u53ef\u4ee5\u770b\u5230\u5728\u6ed1\u52a8\u7a97\u53e3\u5185\u7684 k \u4e2a\u6570\u5b57\u3002\u6ed1\u52a8\u7a97\u53e3\u6bcf\u6b21\u53ea\u5411\u53f3\u79fb\u52a8\u4e00\u4f4d\u3002<\/p>\n
\u8fd4\u56de \u6ed1\u52a8\u7a97\u53e3\u4e2d\u7684\u6700\u5927\u503c \u3002<\/p>\n
\u793a\u4f8b 1\uff1a
\n\u8f93\u5165\uff1anums = [1,3,-1,-3,5,3,6,7], k = 3
\n\u8f93\u51fa\uff1a[3,3,5,5,6,7]<\/p>\n
\u4f7f\u7528\u4f18\u5148\u961f\u5217\u5b58\u50a8\u7a97\u53e3\u5185\u7684\u6570\u5b57\uff0c\u5c31\u53ef\u4ee5\u4f9d\u9760\u4f18\u5148\u961f\u5217\u7684\u6392\u5e8f\u7279\u6027\u83b7\u53d6\u6700\u5927\u503c\u3002\u5b9e\u9645\u4ee3\u7801\u4e2d\uff0c\u5b58\u50a8\u7684\u662f\u4e0b\u6807\uff08\u901a\u8fc7\u4e0b\u6807\u4e5f\u53ef\u4ee5\u76f4\u63a5\u83b7\u53d6\u5230\u5bf9\u5e94\u503c\uff0c\u76f8\u5f53\u4e8e\u5b58\u50a8\u4e86\u4e24\u4e2a\u4fe1\u606f\uff09\uff0c\u901a\u8fc7\u81ea\u5b9a\u4e49\u89c4\u5219\u6765\u5b9e\u73b0\u5bf9\u6570\u5b57\u7684\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u3002 \u9898\u76ee\u4e2d\u8981\u6c42\u7684\u662f\u6700\u5927\u503c\uff0c\u5bf9\u4e8e\u7a97\u53e3\u5185\u7684\u6570\u5b57\uff0c\u5982\u679c\u6bd4\u6700\u65b0\u52a0\u5165\u7a97\u53e3\u7684\u6570\u5b57\u8fd8\u5c0f\uff0c\u5219\u5df2\u7ecf\u53ef\u4ee5\u5220\u6389\u4e86\u3002 \u9898\u76ee\u63cf\u8ff0 \u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 nums\uff0c\u6709\u4e00\u4e2a\u5927\u5c0f\u4e3a k \u7684\u6ed1\u52a8\u7a97\u53e3\u4ece\u6570\u7ec4\u7684\u6700\u5de6\u4fa7\u79fb\u52a8\u5230\u6570\u7ec4\u7684\u6700\u53f3\u4fa7\u3002\u4f60\u53ea\u53ef\u4ee5\u770b […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[20,79,80,77],"class_list":["post-883","post","type-post","status-publish","format-standard","hentry","category-algo","tag-leetcode","tag-79","tag-80","tag-77"],"_links":{"self":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/883","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=883"}],"version-history":[{"count":1,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/883\/revisions"}],"predecessor-version":[{"id":884,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=\/wp\/v2\/posts\/883\/revisions\/884"}],"wp:attachment":[{"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=883"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=883"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.guanhaobo.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=883"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n\u6bcf\u6b21\u79fb\u52a8\u7a97\u53e3\u65f6\uff0c\u628a\u65b0\u6570\u5b57\u6dfb\u52a0\u5230\u7a97\u53e3\u5185\u3002\u6700\u5de6\u4fa7\u9000\u51fa\u7a97\u53e3\u7684\u6570\u5b57\u7406\u8bba\u4e0a\u9700\u8981\u5220\u9664\uff0c\u4f46\u4f18\u5148\u961f\u5217\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(n)\uff0c\u56e0\u6b64\u5220\u9664\u4e00\u4e2a\u6307\u5b9a\u7684\u5143\u7d20\uff0c\u6548\u7387\u5e76\u4e0d\u9ad8\u3002\u53ef\u4ee5\u5148\u4e0d\u5220\u9664\uff0c\u5728\u8bfb\u53d6\u6700\u5927\u503c\u65f6\uff0c\u5982\u679c\u4e0b\u6807\u4e0d\u5728\u6ed1\u52a8\u7a97\u53e3\u8303\u56f4\u5185\uff0c\u518d\u628a\u5b83\u5220\u9664\uff08\u6b64\u65f6\u662f\u961f\u9996\u5220\u9664\uff0c\u590d\u6742\u5ea6 logn\uff09\u3002
\n\u6570\u7ec4\u957f\u5ea6\u4e3a n \uff0c\u961f\u5217\u5185\u6700\u591a\u4f1a\u5b58\u50a8 n \u4e2a\u5143\u7d20\uff0c\u603b\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(n * log n)<\/code>\u3002<\/p>\n\u5355\u8c03\u961f\u5217<\/h2>\n
\n\u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u624b\u52a8\u7ef4\u62a4\u4e00\u4e2a\u5217\u8868\uff0c\u5b58\u50a8\u6570\u5b57\u7684\u4e0b\u6807\uff0c\u6bcf\u6b21\u4ece\u5c3e\u90e8\u6dfb\u52a0\u6570\u636e\u3002\u5728\u6dfb\u52a0\u524d\u68c0\u67e5\u65e7\u7684\u5c3e\u90e8\u4e0b\u6807\u5bf9\u5e94\u7684\u6570\u5b57\u662f\u5426\u5e94\u8be5\u88ab\u79fb\u9664\uff08\u5982\u679c\u79fb\u9664\u5219\u7ee7\u7eed\u68c0\u67e5\u5c3e\u90e8\uff0c\u76f4\u5230\u5c3e\u90e8\u5bf9\u5e94\u6570\u636e > \u5373\u5c06\u6dfb\u52a0\u7684\u4e0b\u6807\u5bf9\u5e94\u6570\u636e\uff09\u3002\u6700\u7ec8\u6548\u679c\u5c31\u662f\uff0c\u5217\u8868\u4ece\u5934\u5230\u5c3e\u4e0b\u6807\u9012\u589e\uff0c\u4e14\u4e0b\u6807\u5bf9\u5e94\u7684\u6570\u5b57\u9012\u51cf\u3002
\n\u6bcf\u6b21\u79fb\u52a8\u7a97\u53e3\u90fd\u662f\u5728\u4e0a\u4e00\u6b21\u7684\u57fa\u7840\u4e0a\u5bf9\u5355\u8c03\u961f\u5217\u505a\u7ef4\u62a4\uff0c\u56e0\u6b64\u6548\u7387\u5f88\u9ad8\u3002
\n\u6bcf\u4e2a\u4e0b\u6807\u90fd\u53ea\u4f1a\u88ab\u6dfb\u52a0\u4e00\u6b21\u3001\u5220\u9664\u4e00\u6b21\uff0c\u6574\u4f53\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a O(n)<\/code>.<\/p>\nJava<\/h1>\n
\/\/ \u4f18\u5148\u961f\u5217\npublic int[] maxSlidingWindow1(int[] nums, int k) {\n PriorityQueue<Integer> queue = new PriorityQueue<>(new Comparator<Integer>() {\n @Override\n public int compare(Integer o1, Integer o2) {\n return Integer.compare(nums[o2], nums[o1]);\n }\n });\n int r = 0;\n int[] ans = new int[nums.length - k + 1];\n for (int l = 0; l <= nums.length - k; l++) {\n while (r < l + k) {\n queue.offer(r);\n r++;\n }\n\n while (queue.peek() < l) {\n queue.poll();\n }\n ans[l] = nums[queue.peek()];\n }\n return ans;\n}\n\n\/\/ \u5355\u8c03\u961f\u5217\npublic int[] maxSlidingWindow2(int[] nums, int k) {\n LinkedList<Integer> list = new LinkedList<>();\n int[] ans = new int[nums.length - k + 1];\n for (int l = 0, r = 0; l <= nums.length - k; l++) {\n while (r < l + k) {\n Integer last = list.peekLast();\n if (last != null && nums[last] < nums[r]) {\n list.pollLast();\n } else {\n list.offerLast(r++);\n }\n }\n while (list.peekFirst() < l) {\n list.pollFirst();\n }\n\n ans[l] = nums[list.peekFirst()];\n }\n\n return ans;\n}\n<\/code><\/pre>\nKotlin<\/h1>\n
\/\/ \u4f18\u5148\u961f\u5217\nfun maxSlidingWindow1(nums: IntArray, k: Int): IntArray {\n val ans = IntArray(nums.size - k + 1)\n val queue = PriorityQueue<Int>(object : Comparator<Int> {\n override fun compare(o1: Int, o2: Int): Int {\n return nums[o2].compareTo(nums[o1])\n }\n })\n var r = 0\n for (l in 0..nums.size - k) {\n while (r < l + k) {\n queue.offer(r++)\n }\n while (queue.peek() < l) {\n queue.poll()\n }\n ans[l] = nums[queue.peek()]\n }\n return ans\n}\n\n\/\/ \u5355\u8c03\u961f\u5217\nfun maxSlidingWindow2(nums: IntArray, k: Int): IntArray {\n val ans = IntArray(nums.size - k + 1)\n val list = LinkedList<Int>()\n var r = 0\n for (l in 0..nums.size - k) {\n while (r < l + k) {\n val last = list.peekLast()\n if (last != null && nums[last] < nums[r]) {\n list.pollLast()\n } else {\n list.offerLast(r++)\n }\n }\n while (list.peekFirst() < l) {\n list.pollFirst()\n }\n ans[l] = nums[list.peekFirst()]\n }\n\n return ans\n}\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"