Update stack_queue.md

Author: skyz8421

data_structure/stack_queue.md

@@ -287,10 +287,24 @@ class Solution:
 > 返回 滑动窗口中的最大值 。
 思路：这道题得想到一个数据结构，当滑动窗口一进一出，能够自动把最大值拱上来，只有最大堆了
 ```python
-
+import heapq
+class Solution:
+    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]: #最大堆队列
+        hq = list()
+        ans = list()
+        for i, num in enumerate(nums):
+            while hq and hq[0][1] <= i - k:
+                heapq.heappop(hq)
+            heapq.heappush(hq, [-num,i])
+            if i >= k - 1:
+                ans.append(-hq[0][0])
+        return ans
 
 ```
 
+或者考虑使用双边队列
+
+
 
 
 ### [decode-string](https://leetcode-cn.com/problems/decode-string/)