From 467461c24e569aab83bc954c3ba8a1e7fb4b7854 Mon Sep 17 00:00:00 2001
From: NevS <1173325467@qq.com>
Date: Thu, 20 May 2021 23:51:45 +0800
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=20go=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/0209.长度最小的子数组.md | 26 ++++++++++++++++++++++-
1 file changed, 25 insertions(+), 1 deletion(-)
diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index 0aaa466e..29f15581 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -172,6 +172,30 @@ Python：
Go：
+```go
+func minSubArrayLen(target int, nums []int) int {
+ i := 0
+ l := len(nums) // 数组长度
+ sum := 0 // 子数组之和
+ result := l + 1 // 初始化返回长度为l+1，目的是为了判断“不存在符合条件的子数组，返回0”的情况
+ for j := 0; j < l; j++ {
+ sum += nums[j]
+ for sum >= target {
+ subLength := j - i + 1
+ if subLength < result {
+ result = subLength
+ }
+ sum -= nums[i]
+ i++
+ }
+ }
+ if result == l+1 {
+ return 0
+ } else {
+ return result
+ }
+}
+```
JavaScript:
@@ -195,4 +219,4 @@ var minSubArrayLen = (target, nums) => {
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
