{"id":1414,"date":"2023-06-19T18:07:58","date_gmt":"2023-06-19T10:07:58","guid":{"rendered":"https:\/\/xinchewhd.com.cn\/?p=1414"},"modified":"2023-06-19T18:07:58","modified_gmt":"2023-06-19T10:07:58","slug":"%e3%80%90%e7%ae%97%e6%b3%95%e9%a2%98%e8%a7%a3%e3%80%9123-%e6%bb%91%e5%8a%a8%e7%aa%97%e5%8f%a3%e6%9c%80%e5%a4%a7%e5%80%bc-%e5%8d%95%e8%b0%83%e9%98%9f%e5%88%97%e8%a7%a3%e6%b3%95","status":"publish","type":"post","link":"https:\/\/xinchewhd.com.cn\/index.php\/%e7%ae%97%e6%b3%95\/%e3%80%90%e7%ae%97%e6%b3%95%e9%a2%98%e8%a7%a3%e3%80%9123-%e6%bb%91%e5%8a%a8%e7%aa%97%e5%8f%a3%e6%9c%80%e5%a4%a7%e5%80%bc-%e5%8d%95%e8%b0%83%e9%98%9f%e5%88%97%e8%a7%a3%e6%b3%95\/","title":{"rendered":"\u3010\u7b97\u6cd5\u9898\u89e3\u301123. \u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c \u2014\u2014 \u5355\u8c03\u961f\u5217\u89e3\u6cd5"},"content":{"rendered":"
\n
\n
\n
\n

\u8fd9\u662f\u4e00\u9053 \u300c\u56f0\u96be\u300d<\/strong> \u9898
\u9898\u76ee\u6765\u81ea\uff1ahttps:\/\/leetcode.cn\/problems\/sliding-window-maximum\/<\/p>\n<\/blockquote>\n<\/blockquote>\n

<\/span>\u9898\u76ee<\/span><\/span><\/h2>\n

\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 nums<\/code>\uff0c\u6709\u4e00\u4e2a\u5927\u5c0f\u4e3a k<\/code> \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<\/code> \u4e2a\u6570\u5b57\u3002\u6ed1\u52a8\u7a97\u53e3\u6bcf\u6b21\u53ea\u5411\u53f3\u79fb\u52a8\u4e00\u4f4d\u3002<\/p>\n

\u8fd4\u56de \u300c\u6ed1\u52a8\u7a97\u53e3\u4e2d\u7684\u6700\u5927\u503c\u300d<\/strong> \u3002<\/p>\n

\u793a\u4f8b 1\uff1a<\/p>\n

<\/span>func<\/span> maxSlidingWindow<\/span>(nums []int<\/span>, k int<\/span>)<\/span> []int<\/span><\/span> {

    n := len<\/span>(nums)
    deque := []int<\/span>{}
    ans := make<\/span>([]int<\/span>, 0<\/span>, n - k + 1<\/span>)

    for<\/span> i, num := range<\/span> nums {
        \/\/ \u5c06\u51fa\u754c\u7684\u4e0b\u6807\u5220\u9664<\/span>
        if<\/span> i >= k && deque[0<\/span>] <= i - k {
            deque = deque[1<\/span>:]
        }

        \/\/ \u5c06 i \u6dfb\u52a0\u5230\u961f\u5217\uff0c\u5e76\u4fdd\u8bc1\u961f\u5217\u662f\u9012\u51cf\u7684\u3002<\/span>
        for<\/span> len<\/span>(deque) > 0<\/span> && nums[deque[len<\/span>(deque) - 1<\/span>]] <= num {
            deque = deque[:len<\/span>(deque) - 1<\/span>]
        }
        deque = append<\/span>(deque, i)

        if<\/span> i >= k - 1<\/span> {
            ans = append<\/span>(ans, nums[deque[0<\/span>]])
        }

    }

    return<\/span> ans

}
<\/code><\/pre>\n
<\/span><\/span>\u590d\u6742\u5ea6\u5206\u6790<\/span><\/span><\/h4>\n
\u65f6\u95f4\u590d\u6742\u5ea6\uff1a<\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span>\uff0c\u5faa\u73af n<\/code> \u6b21\u3002<\/p>\n
\u7a7a\u95f4\u590d\u6742\u5ea6\uff1a<\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span>\uff0c\u961f\u5217\u4e2d\u6700\u591a\u5b58\u653e k<\/code> \u4e2a\u5143\u7d20\uff0c\u8ba1\u7b97\u590d\u6742\u5ea6\u65f6\u5ffd\u7565\u4e86\u8fd4\u56de\u503c ans<\/code>\u3002<\/p>\n
\n
\n
\n
\n
\n