feat: add solutions to lc problems: No.0209

No.0209.Minimum Size Subarray Sum

Author: YangFong

solution/0200-0299/0209.Minimum Size Subarray Sum/README.md

@@ -273,6 +273,55 @@ public class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minSubArrayLen(target: number, nums: number[]): number {
+    const n = nums.length;
+    let res = Infinity;
+    let sum = 0;
+    let i = 0;
+    let j = 0;
+    while (j <= n) {
+        if (sum < target) {
+            sum += nums[j];
+            j++;
+        } else {
+            res = Math.min(res, j - i);
+            sum -= nums[i];
+            i++;
+        }
+    }
+    return res === Infinity ? 0 : res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut res = n + 1;
+        let mut sum = 0;
+        let mut l = 0;
+        for r in 0..n {
+            sum += nums[r];
+
+            while sum >= target {
+                res = res.min(r - l + 1);
+                sum -= nums[l];
+                l += 1;
+            }
+        }
+        if res == n + 1 {
+            return 0;
+        }
+        res as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0209.Minimum Size Subarray Sum/README_EN.md

@@ -248,6 +248,55 @@ public class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minSubArrayLen(target: number, nums: number[]): number {
+    const n = nums.length;
+    let res = Infinity;
+    let sum = 0;
+    let i = 0;
+    let j = 0;
+    while (j <= n) {
+        if (sum < target) {
+            sum += nums[j];
+            j++;
+        } else {
+            res = Math.min(res, j - i);
+            sum -= nums[i];
+            i++;
+        }
+    }
+    return res === Infinity ? 0 : res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut res = n + 1;
+        let mut sum = 0;
+        let mut l = 0;
+        for r in 0..n {
+            sum += nums[r];
+
+            while sum >= target {
+                res = res.min(r - l + 1);
+                sum -= nums[l];
+                l += 1;
+            }
+        }
+        if res == n + 1 {
+            return 0;
+        }
+        res as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0209.Minimum Size Subarray Sum/Solution.rs

@@ -0,0 +1,21 @@
+impl Solution {
+    pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
+        let n = nums.len();
+        let mut res = n + 1;
+        let mut sum = 0;
+        let mut l = 0;
+        for r in 0..n {
+            sum += nums[r];
+
+            while sum >= target {
+                res = res.min(r - l + 1);
+                sum -= nums[l];
+                l += 1;
+            }
+        }
+        if res == n + 1 {
+            return 0;
+        }
+        res as i32
+    }
+}

solution/0200-0299/0209.Minimum Size Subarray Sum/Solution.ts

@@ -0,0 +1,18 @@
+function minSubArrayLen(target: number, nums: number[]): number {
+    const n = nums.length;
+    let res = Infinity;
+    let sum = 0;
+    let i = 0;
+    let j = 0;
+    while (j <= n) {
+        if (sum < target) {
+            sum += nums[j];
+            j++;
+        } else {
+            res = Math.min(res, j - i);
+            sum -= nums[i];
+            i++;
+        }
+    }
+    return res === Infinity ? 0 : res;
+}