목록2024/04/01 (1)

넘치게 채우기

[LeetCode] 2444. Count Subarrays With Fixed Bounds

https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/ LeetCode - Count Subarrays With Fixed Bounds 문제 유형 : 슬라이딩 윈도우 문제 난이도 : Hard 문제 You are given an integer array nums and two integers minK and maxK. A fixed-bound subarray of nums is a subarray that satisfies the following conditions: The minimum value in the subarray is equal to minK. The maximum value in the subarray is..
PS/LeetCode 2024. 4. 1. 00:07
이전 Prev 1 Next 다음