length-of-longest-subarray-with-at-most-k-frequency

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>.

The frequency of an element <code>x</code> is the number of times it occurs in an array.

An array is called good if the frequency of each element in this array is less than or equal to <code>k</code>.

Return the length of the longest good subarray of <code>nums</code>.

A subarray is a contiguous non-empty sequence of elements within an array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,3,1,2,3,1,2], k = 2
Output: 6
Explanation: The longest possible good subarray is [1,2,3,1,2,3] since the values 1, 2, and 3 occur at most twice in this subarray. Note that the subarrays [2,3,1,2,3,1] and [3,1,2,3,1,2] are also good.
It can be shown that there are no good subarrays with length more than 6.
</pre>

Example 2:

<pre>
Input: nums = [1,2,1,2,1,2,1,2], k = 1
Output: 2
Explanation: The longest possible good subarray is [1,2] since the values 1 and 2 occur at most once in this subarray. Note that the subarray [2,1] is also good.
It can be shown that there are no good subarrays with length more than 2.
</pre>

Example 3:

<pre>
Input: nums = [5,5,5,5,5,5,5], k = 4
Output: 4
Explanation: The longest possible good subarray is [5,5,5,5] since the value 5 occurs 4 times in this subarray.
It can be shown that there are no good subarrays with length more than 4.
</pre>

&nbsp;
Constraints:

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

第 119 场双周赛

biweekly-contest-119

maxSubarrayLength

资深工程师

Length of Longest Subarray With at Most K Frequency

Longest Substring with At Least K Repeating Characters

longest-substring-with-at-least-k-repeating-characters

至少有 K 个重复字符的最长子串

Array

Hash Table

Sliding Window

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。

一个元素 <code>x</code>&nbsp;在数组中的 频率&nbsp;指的是它在数组中的出现次数。

如果一个数组中所有元素的频率都 小于等于&nbsp;<code>k</code>&nbsp;，那么我们称这个数组是 好&nbsp;数组。

请你返回 <code>nums</code>&nbsp;中 最长好&nbsp;子数组的长度。

子数组 指的是一个数组中一段连续非空的元素序列。

&nbsp;

示例 1：

<pre>
输入：nums = [1,2,3,1,2,3,1,2], k = 2
输出：6
解释：最长好子数组是 [1,2,3,1,2,3] ，值 1 ，2 和 3 在子数组中的频率都没有超过 k = 2 。[2,3,1,2,3,1] 和 [3,1,2,3,1,2] 也是好子数组。
最长好子数组的长度为 6 。
</pre>

示例 2：

<pre>
输入：nums = [1,2,1,2,1,2,1,2], k = 1
输出：2
解释：最长好子数组是 [1,2] ，值 1 和 2 在子数组中的频率都没有超过 k = 1 。[2,1] 也是好子数组。
最长好子数组的长度为 2 。
</pre>

示例 3：

<pre>
输入：nums = [5,5,5,5,5,5,5], k = 4
输出：4
解释：最长好子数组是 [5,5,5,5] ，值 5 在子数组中的频率没有超过 k = 4 。
最长好子数组的长度为 4 。
</pre>

&nbsp;

提示：

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