2444. 统计定界子数组的数目

2444. 统计定界子数组的数目

---

题目链接：2444. 统计定界子数组的数目

代码如下：

//参考链接：https://leetcode.cn/problems/count-subarrays-with-fixed-bounds/solutions/1895713/jian-ji-xie-fa-pythonjavacgo-by-endlessc-gag2
class Solution {
public:long long countSubarrays(vector<int>& nums, int minK, int maxK) {long;long res = 0;int min_i =-1, max_i = -1, i0 = -1;for (int i = 0;i < nums.size();i++) {int x = nums[i];if (x == minK) {min_i = i;//最近的minK位置}if (x == maxK) {max_i = i;//最近的maxK位置}if (x<minK || x>maxK) {i0 = i;//子数组不能包含nums[i0];}res += max(min(min_i, max_i) - i0, 0);}return res;}
};