From e445b35d3691edf9ec0ab9fe30aaa6357b3c518a Mon Sep 17 00:00:00 2001
From: NevS <1173325467@qq.com>
Date: Sun, 13 Jun 2021 01:55:37 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200239.=E6=BB=91=E5=8A=A8?=
 =?UTF-8?q?=E7=AA=97=E5=8F=A3=E6=9C=80=E5=A4=A7=E5=80=BC=20go=E7=89=88=20?=
 =?UTF-8?q?=EF=BC=88=E5=A2=9E=E5=8A=A0=E5=B0=81=E8=A3=85=E5=8D=95=E8=B0=83?=
 =?UTF-8?q?=E9=98=9F=E5=88=97=E8=A7=A3=E9=A2=98=E7=9A=84=E6=96=B9=E5=BC=8F?=
 =?UTF-8?q?=EF=BC=89?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

增加封装单调队列解题的方式
---
 problems/0239.滑动窗口最大值.md | 60 ++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)

diff --git a/problems/0239.滑动窗口最大值.md b/problems/0239.滑动窗口最大值.md
index 47383a47..d108335b 100644
--- a/problems/0239.滑动窗口最大值.md
+++ b/problems/0239.滑动窗口最大值.md
@@ -332,6 +332,66 @@ func maxSlidingWindow(nums []int, k int) []int {
 
 ```
 
+```go
+// 封装单调队列的方式解题
+type MyQueue struct {
+    queue []int
+}
+
+func NewMyQueue() *MyQueue {
+    return &MyQueue{
+        queue: make([]int, 0),
+    }
+}
+
+func (m *MyQueue) Front() int {
+    return m.queue[0]
+}
+
+func (m *MyQueue) Back() int {
+    return m.queue[len(m.queue)-1]
+}
+
+func (m *MyQueue) Empty() bool {
+    return len(m.queue) == 0
+}
+
+func (m *MyQueue) Push(val int) {
+    for !m.Empty() && val > m.Back() {
+        m.queue = m.queue[:len(m.queue)-1]
+    }
+    m.queue = append(m.queue, val)
+}
+
+func (m *MyQueue) Pop(val int) {
+    if !m.Empty() && val == m.Front() {
+        m.queue = m.queue[1:]
+    }
+}
+
+func maxSlidingWindow(nums []int, k int) []int {
+    queue := NewMyQueue()
+    length := len(nums)
+    res := make([]int, 0)
+    // 先将前k个元素放入队列
+    for i := 0; i < k; i++ {
+        queue.Push(nums[i])
+    }
+    // 记录前k个元素的最大值
+    res = append(res, queue.Front())
+
+    for i := k; i < length; i++ {
+        // 滑动窗口移除最前面的元素
+        queue.Pop(nums[i-k])
+        // 滑动窗口添加最后面的元素
+        queue.Push(nums[i])
+        // 记录最大值
+        res = append(res, queue.Front())
+    }
+    return res
+}
+```
+
 Javascript:
 ```javascript
 var maxSlidingWindow = function (nums, k) {