Merge pull request soapyigu#275 from xieweiAlex/fix_typo_valid_vs_inv…

…alid

[Array] Fix typo, should be valid instead of invalid

Array/MinimumSizeSubarraySum.swift

@@ -1,7 +1,7 @@
 /**
  * Question Link: https://leetcode.com/problems/minimum-size-subarray-sum/
  * Primary idea: Two Pointers, anchor the former and move forward the latter one to ensure the sum of subarray just covers the target
- * Note: There could be no invalid subarray which sum >= target
+ * Note: There could be no valid subarray which sum >= target
  * Time Complexity: O(n), Space Complexity: O(1)
  *
  */
@@ -13,7 +13,7 @@
         for (i, num) in nums.enumerated() {
             currentSum += num
 
-            while currentSum >= s && start <= i {
+            while currentSum >= s, start <= i {
                 miniSize = min(miniSize, i - start + 1)
 
                 currentSum -= nums[start]
@@ -23,4 +23,4 @@
 
         return miniSize == Int.max ? 0 : miniSize
     }
-}
+}