Minimum Size Subarray Sum (Leetcode 209)

Problem Link: https://leetcode.com/problems/minimum-size-subarray-sum/

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        
        j=0
        ans=float('inf')
        n=len(nums)
        summ=0
        for i in range(n):
            summ+=nums[i]
            
            while(summ>=target):
                ans=min(ans,i-j+1)
                summ-=nums[j]
                j+=1
        if(ans==inf):
            ans=0
        return ans