feat: add solutions to lc/lcof2 problems (doocs#630)

Yousazoe · web-flow · commit 3869b283a61d · 2021-12-12T23:28:35.000+08:00
lc No.0209 &amp; lcof2 No.008.Minimum Size Subarray Sum
diff --git a/lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/README.md b/lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/README.md
@@ -136,6 +136,30 @@ func min(a, b int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0; 
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
+```
+
+
 ### **...**
 
 ```
diff --git a/lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/Solution.cpp b/lcof2/剑指 Offer II 008. 和大于等于 target 的最短子数组/Solution.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0;
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
diff --git a/solution/0200-0299/0209.Minimum Size Subarray Sum/README.md b/solution/0200-0299/0209.Minimum Size Subarray Sum/README.md
@@ -166,6 +166,30 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0; 
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
+```
+
+
 ### **C#**
 
 ```cs
diff --git a/solution/0200-0299/0209.Minimum Size Subarray Sum/README_EN.md b/solution/0200-0299/0209.Minimum Size Subarray Sum/README_EN.md
@@ -143,6 +143,30 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0; 
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
+```
+
+
 ### **C#**
 
 ```cs
diff --git a/solution/0200-0299/0209.Minimum Size Subarray Sum/Solution.cpp b/solution/0200-0299/0209.Minimum Size Subarray Sum/Solution.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int minSubArrayLen(int target, vector<int>& nums) {
+        int left = 0, right;
+        int sum = 0;
+        int minlen = INT_MAX;
+
+        for (right = 0; right < nums.size(); right++) {
+            sum += nums[right];
+            while(left <= right && sum >= target) {
+                minlen = min(minlen, right - left + 1);
+                sum -= nums[left++];
+            }
+        }
+
+        return minlen == INT_MAX? 0: minlen;
+    }
+};
