From 1ded7e92b975da71d32dd752d3b98816be3b2d30 Mon Sep 17 00:00:00 2001
From: YiChih Wang <andywang0607@gmail.com>
Date: Thu, 26 Aug 2021 21:15:58 +0800
Subject: [PATCH] =?UTF-8?q?=E5=A2=9E=E5=8A=A00209.=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=84Rust?=
 =?UTF-8?q?=E8=AA=9E=E8=A8=80=E5=AF=A6=E7=8F=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Note
- leetcode上提交通過
---
 problems/0209.长度最小的子数组.md | 26 +++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index 45d2a229..ceca8c87 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -237,6 +237,32 @@ func minSubArrayLen(_ target: Int, _ nums: [Int]) -> Int {
 }
 ```
 
+Rust:
+
+```rust
+impl Solution {
+    pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {        
+        let (mut result, mut subLength): (i32, i32) = (i32::MAX, 0);
+        let (mut sum, mut i) = (0, 0);
+        
+        for (pos, val) in nums.iter().enumerate() {
+            sum += val;      
+            while sum >= target {
+                subLength = (pos - i + 1) as i32;
+                if result > subLength {
+                    result = subLength;
+                }
+                sum -= nums[i];
+                i += 1;
+            }
+        }
+        if result == i32::MAX {
+            return 0;
+        }
+        result
+    }
+}
+```
 
 
 -----------------------