count-subarrays-with-fixed-bounds

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>nums</code> and two integers <code>minK</code> and <code>maxK</code>.

A fixed-bound subarray of <code>nums</code> is a subarray that satisfies the following conditions:

<ul>
	<li>The minimum value in the subarray is equal to <code>minK</code>.</li>
	<li>The maximum value in the subarray is equal to <code>maxK</code>.</li>
</ul>

Return the number of fixed-bound subarrays.

A subarray is a contiguous part of an array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,3,5,2,7,5], minK = 1, maxK = 5
Output: 2
Explanation: The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
</pre>

Example 2:

<pre>
Input: nums = [1,1,1,1], minK = 1, maxK = 1
Output: 10
Explanation: Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], minK, maxK &lt;= 106</code></li>
</ul>

countSubarrays

Count Subarrays With Fixed Bounds

Count Number of Nice Subarrays

count-number-of-nice-subarrays

统计「优美子数组」

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

绝对差不超过限制的最长连续子数组

Find the Number of Subarrays Where Boundary Elements Are Maximum

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

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

Queue

Array

Sliding Window

Monotonic Queue

给你一个整数数组 <code>nums</code> 和两个整数 <code>minK</code> 以及 <code>maxK</code> 。

<code>nums</code> 的定界子数组是满足下述条件的一个子数组：

<ul>
	<li>子数组中的 最小值 等于 <code>minK</code> 。</li>
	<li>子数组中的 最大值 等于 <code>maxK</code> 。</li>
</ul>

返回定界子数组的数目。

子数组是数组中的一个连续部分。

&nbsp;

示例 1：

<pre>输入：nums = [1,3,5,2,7,5], minK = 1, maxK = 5
输出：2
解释：定界子数组是 [1,3,5] 和 [1,3,5,2] 。
</pre>

示例 2：

<pre>输入：nums = [1,1,1,1], minK = 1, maxK = 1
输出：10
解释：nums 的每个子数组都是一个定界子数组。共有 10 个子数组。</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], minK, maxK &lt;= 106</code></li>
</ul>