From 739e3f891ce199d7258fa4a192b7fe3dd10a9251 Mon Sep 17 00:00:00 2001
From: C_W <chaow2024@gmail.com>
Date: Fri, 13 Dec 2024 11:43:42 +1100
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.md=20C=20?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0239.滑动窗口最大值.md | 32 ++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)

diff --git a/problems/0239.滑动窗口最大值.md b/problems/0239.滑动窗口最大值.md
index caa24d8d..9bb3494d 100644
--- a/problems/0239.滑动窗口最大值.md
+++ b/problems/0239.滑动窗口最大值.md
@@ -890,6 +890,38 @@ public:
 };
 ```
 
+### C
+
+```c
+int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize) {
+    *returnSize = numsSize - k + 1;
+    int *res = (int*)malloc((*returnSize) * sizeof(int));
+    assert(res);
+    int *deque = (int*)malloc(numsSize * sizeof(int));
+    assert(deque);
+    int front = 0, rear = 0, idx = 0;
+
+    for (int i  = 0 ; i < numsSize ; i++) {
+        while (front < rear && deque[front] <= i - k) {
+            front++;
+        }
+
+        while (front < rear && nums[deque[rear - 1]] <= nums[i]) {
+            rear--;
+        }
+
+        deque[rear++] = i;
+
+        if (i >= k - 1) {
+            res[idx++] = nums[deque[front]];
+        }
+    }       
+
+    return res;
+}
+
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>