Swift LeetCode SlideWindow

Input: target = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: The subarray [4,3] has the minimal length under the problem constraint.
Input: target = 4, nums = [1,4,4]
Output: 1
Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0
  • 1 <= target <= 109
  • 1 <= nums.length <= 105
  • 1 <= nums[i] <= 105
class Solution {
func minSubArrayLen(_ target: Int, _ nums: [Int]) -> Int {
}
}
func minSubArrayLen(_ target: Int, _ nums: [Int]) -> Int {   var windowSum = 0, windowStart = 0   var minWindowSize = Int.max   for windowEnd in 0..<nums.count{   windowSum += nums[windowEnd]   while (windowSum >= target) {     minWindowSize = min(minWindowSize, windowEnd - windowStart + 1)     windowSum -= nums[windowStart]     windowStart += 1   }  } return minWindowSize == Int.max ? 0 : minWindowSize}

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Mario tsai

Mario tsai

Major in physical education. Football referee. And high interest in looking the world through the numbers.