class Solution {
public long countSubarrays(int[] nums, int minK, int maxK) {
int n=nums.length;
long current = 0;
long count = 0;
for(int i =0;i<n;i++){
if(nums[i]<=maxK && nums[i]>=minK){
current++;
}
else{
current=0;
}
count += current;
}
return count;
}
}
Y2xhc3MgU29sdXRpb24gewogICAgcHVibGljIGxvbmcgY291bnRTdWJhcnJheXMoaW50W10gbnVtcywgaW50IG1pbkssIGludCBtYXhLKSB7CiAgICAgICAgaW50IG49bnVtcy5sZW5ndGg7CiAgICAgICAgbG9uZyBjdXJyZW50ID0gMDsKICAgICAgICBsb25nIGNvdW50ID0gMDsKCiAgICAgICAgZm9yKGludCBpID0wO2k8bjtpKyspewogICAgICAgICAgICBpZihudW1zW2ldPD1tYXhLICYmIG51bXNbaV0+PW1pbkspewogICAgICAgICAgICAgICAgY3VycmVudCsrOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGVsc2V7CiAgICAgICAgICAgICAgICBjdXJyZW50PTA7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgY291bnQgKz0gY3VycmVudDsKICAgICAgICB9CiAgICAgICAgcmV0dXJuIGNvdW50OwogICAgfQp9