count-complete-subarrays-in-an-array

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 array <code>nums</code> consisting of positive integers.

We call a subarray of an array complete if the following condition is satisfied:

<ul>
	<li>The number of distinct elements in the subarray is equal to the number of distinct elements in the whole array.</li>
</ul>

Return the number of complete subarrays.

A subarray is a contiguous non-empty part of an array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,3,1,2,2]
Output: 4
Explanation: The complete subarrays are the following: [1,3,1,2], [1,3,1,2,2], [3,1,2] and [3,1,2,2].
</pre>

Example 2:

<pre>
Input: nums = [5,5,5,5]
Output: 10
Explanation: The array consists only of the integer 5, so any subarray is complete. The number of subarrays that we can choose is 10.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2000</code></li>
</ul>

countCompleteSubarrays

Count Complete Subarrays in an Array

Longest Substring Without Repeating Characters

longest-substring-without-repeating-characters

无重复字符的最长子串

Subarrays with K Different Integers

subarrays-with-k-different-integers

K 个不同整数的子数组

Array

Hash Table

Sliding Window

给你一个由 正 整数组成的数组 <code>nums</code> 。

如果数组中的某个子数组满足下述条件，则称之为 完全子数组 ：

<ul>
	<li>子数组中 不同 元素的数目等于整个数组不同元素的数目。</li>
</ul>

返回数组中 完全子数组 的数目。

子数组 是数组中的一个连续非空序列。

&nbsp;

示例 1：

<pre>输入：nums = [1,3,1,2,2]
输出：4
解释：完全子数组有：[1,3,1,2]、[1,3,1,2,2]、[3,1,2] 和 [3,1,2,2] 。
</pre>

示例 2：

<pre>输入：nums = [5,5,5,5]
输出：10
解释：数组仅由整数 5 组成，所以任意子数组都满足完全子数组的条件。子数组的总数为 10 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2000</code></li>
</ul>