algorithm 썸네일형 리스트형 [Swift] Leetcode 209. Minimum Size Subarray Sum 209. Minimum Size Subarray Sum Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead. Example: Input: s = 7, nums = [2,3,1,2,4,3] Output: 2 Explanation: the subarray [4,3] has the minimal length under the problem constraint. Coding! Using Binary search func minSubArrayLen(_ s: In.. 더보기 이전 1 다음
