number-of-subarrays-with-bounded-maximum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code> and two integers <code>left</code> and <code>right</code>, return the number of contiguous non-empty subarrays such that the value of the maximum array element in that subarray is in the range <code>[left, right]</code>.

The test cases are generated so that the answer will fit in a 32-bit integer.

&nbsp;
Example 1:

<pre>
Input: nums = [2,1,4,3], left = 2, right = 3
Output: 3
Explanation: There are three subarrays that meet the requirements: [2], [2, 1], [3].
</pre>

Example 2:

<pre>
Input: nums = [2,9,2,5,6], left = 2, right = 8
Output: 7
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= left &lt;= right &lt;= 109</code></li>
</ul>

numSubarrayBoundedMax

Number of Subarrays with Bounded Maximum

Count Subarrays With Median K

count-subarrays-with-median-k

统计中位数为 K 的子数组

Find the Number of Subarrays Where Boundary Elements Are Maximum

find-the-number-of-subarrays-where-boundary-elements-are-maximum

边界元素是最大值的子数组数目

Array

Two Pointers

给你一个整数数组 <code>nums</code> 和两个整数：<code>left</code> 及 <code>right</code> 。找出 <code>nums</code> 中连续、非空且其中最大元素在范围&nbsp;<code>[left, right]</code> 内的子数组，并返回满足条件的子数组的个数。

生成的测试用例保证结果符合 32-bit 整数范围。

&nbsp;

示例 1：

<pre>
输入：nums = [2,1,4,3], left = 2, right = 3
输出：3
解释：满足条件的三个子数组：[2], [2, 1], [3]
</pre>

示例 2：

<pre>
输入：nums = [2,9,2,5,6], left = 2, right = 8
输出：7
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= left &lt;= right &lt;= 109</code></li>
</ul>