左闭右开总结

最新推荐文章于 2024-07-25 19:34:38 发布

viva_la_vida__

最新推荐文章于 2024-07-25 19:34:38 发布

阅读量200

点赞数

分类专栏：基础文章标签： leetcode 算法

本文链接：https://blog.csdn.net/mayuqing98/article/details/125847288

版权

基础专栏收录该内容

4 篇文章 0 订阅

订阅专栏

209. Minimum Size Subarray Sum

Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead.

Example 1:

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.

Example 2:

Input: target = 4, nums = [1,4,4]
Output: 1

Example 3:

Input: target = 11, nums = [1,1,1,1,1,1,1,1]
Output: 0

Constraints:

1 <= target <= 109
1 <= nums.length <= 105
1 <= nums[i] <= 104

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

Accepted

563,801

Submissions

1,282,432

用双指针。边界值是需要注意的，贯彻左闭右开思想，左指针一直在当前被计算的位置，右指针在该区间往后一个位置

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        num = 0
        l = 0
        minLen = float('inf')
        n = len(nums)
        r =0
        
        while r<n:
            while r<n and (l==r or num<target):
                num+=nums[r]
                r+=1
            while l<r and num>=target:
                minLen = min(r-l,minLen)
                num-=nums[l]
                l+=1
        return minLen if minLen!=float('inf') else 0