Leetcode_Minimum Size Subarray Sum

Tag
Array\Two Pointers\Binary Search
Difficulty
Medium
Description
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.
For example, given the array [2,3,1,2,4,3] and s = 7,
the subarray [4,3] has the minimal length under the problem constraint.
Code

• Two Pointers
  用两个指针P1,P2，前者去控制>=S满足的INDEX位置，后者去控制扣除前面的若干个位置

class Solution(object):
    def minSubArrayLen(self, s, nums):
        """
        :type s: int
        :type nums: List[int]
        :rtype: int
        """
        ret = len(nums)+1
        ss = 0
        p1 = 0
        p2 = 0
        while(ss<s and p1<len(nums)):
            ss = ss + nums[p1]
            p1 = p1+1
            while(ss>=s):
                ret = min(ret,p1-p2)
                ss = ss - nums[p2]
                p2 = p2 + 1
        if ret == len(nums)+1:
            return 0
        return ret