2023.03.04 Today's Challenge

https://leetcode.com/problems/count-subarrays-with-fixed-bounds/

Count Subarrays With Fixed Bounds - LeetCode

투 포인터로 푸는 문제.
슬라이딩 윈도우와 투 포인터가 꽤 많이 나오는 솔루션 중에 하나 인듯.

class Solution:
    def countSubarrays(self, nums: List[int], minK: int, maxK: int) -> int:
        answer = 0
        minp = maxp = lb = -1

        for i, n in enumerate(nums):
            if n < minK or n > maxK:
                lb = i
            if n == minK:
                minp = i
            if n == maxK:
                maxp = i
            answer += max(0, min(minp, maxp) - lb)
        
        return answer