Minimum Size Subarray Sum LeetCode solution in Python

1
class Solution:
2
    def minSubArrayLen(self, target, nums):
3
        # Init left pointer and answer
4
        l, ans = 0, len(nums) + 1
5
        # Init sum of subarray
6
        s = 0
7
        # Iterate through all numbers as right subarray
8
        for r in range(len(nums)):
9
            # Add right number to sum
10
            s += nums[r]
11
            # Check for subarray greater than or equal to target
12
            while s >= target:
13
                # Calculate new min
14
                ans = min(ans, r - l + 1)
15
                # Remove current left nubmer from sum
16
                s -= nums[l]
17
                # Move left index up one
18
                l += 1
19
        # No solution
20
        if ans == len(nums) + 1:
21
            return 0
22
        # Solution
23
        return ans