Leetcode 209. 长度最小的子数组

209. 长度最小的子数组

难度: Medium

刷题内容

原题连接

• https://leetcode.com/problems/minimum-size-subarray-sum/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.

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

解题方案

思路 1
- 时间复杂度: O(N)******- 空间复杂度: O(1)

双指针走起，beats 98.40%

class Solution(object):
    def minSubArrayLen(self, s, nums):
        """
        :type s: int
        :type nums: List[int]
        :rtype: int
        """
        start