From a6a8dc080647bfe243824a7990f346941f5aa128 Mon Sep 17 00:00:00 2001
From: nolanzzz <nolanwork131@gmail.com>
Date: Wed, 1 Sep 2021 19:05:54 -0400
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200209.=E9=95=BF=E5=BA=A6?=
 =?UTF-8?q?=E6=9C=80=E5=B0=8F=E7=9A=84=E5=AD=90=E6=95=B0=E7=BB=84=20PHP?=
 =?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/0209.长度最小的子数组.md | 28 +++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index ceca8c87..7c3fd0e7 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -264,6 +264,34 @@ impl Solution {
 }
 ```
 
+PHP:
+```php
+// 双指针 - 滑动窗口
+class Solution {
+    /**
+     * @param Integer $target
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function minSubArrayLen($target, $nums) {
+        if (count($nums) < 1) {
+            return 0;
+        }
+        $sum = 0;
+        $res = PHP_INT_MAX;
+        $left = 0;
+        for ($right = 0; $right < count($nums); $right++) {
+            $sum += $nums[$right];
+            while ($sum >= $target) {
+                $res = min($res, $right - $left + 1);
+                $sum -= $nums[$left];
+                $left++;
+            }
+        }
+        return $res == PHP_INT_MAX ? 0 : $res;
+    }
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)