leetcode-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.

Follow up:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

双指针

数组满足一定条件的求解大多可用双指针。
这题求子数组和大于等于s的最小长度，可用i，j来表示和大于等于s的数据的端点下标。然后在满足条件的情况下求最小长度。

class Solution(object):
    def minSubArrayLen(self, s, nums):
        """
        :type s: int
        :type nums: List[int]
        :rtype: int
        """
        if not nums or sum(nums)<s:
            return 0
        l,r = 0,0
        ssum = 0
        res = float('inf')
        while r<len(nums):
            ssum += nums[r]
            while ssum>=s:
                res = min(res,r-l+1)
                ssum -= nums[l]
                l += 1
            r += 1
        return res if res != float('inf') else 0

前缀+二分法

先得到数组元素每个位置的累加和，也就是前缀的和，然后查找出累加和与目标值的差值所在的位置，求其表示数组的最小长度。

class Solution(object):
    def minSubArrayLen(self, s, nums):
        """
        :type s: int
        :type nums: List[int]
        :rtype: int
        """
        if not nums or sum(nums)<s:
            return 0
        res = float('inf')
        for i in range(1,len(nums)):
            nums[i] += nums[i-1]
        nums = [0] + nums
        for i in range(1,len(nums)):
            target = nums[i]-s
            if target <0:
                continue
            pos = self.binarySearch(nums,target)
            if pos>len(nums):
                continue
            if nums[i]-nums[pos] == s:
                res = min(res,i-pos)
            elif nums[i]-nums[pos]<s:
                res = min(res,i-pos+1)
        return res if res!=float('inf') else 0
    
    def binarySearch(self,nums,target):
        l ,r = 0,len(nums)
        while l<r:
            mid = (l+r)//2
            if nums[mid] < target:
                l = mid+1
            else:
                r = mid
        return l