maximum-sum-of-distinct-subarrays-with-length-k

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 an integer <code>k</code>. Find the maximum subarray sum of all the subarrays of <code>nums</code> that meet the following conditions:

<ul>
	<li>The length of the subarray is <code>k</code>, and</li>
	<li>All the elements of the subarray are distinct.</li>
</ul>

Return the maximum subarray sum of all the subarrays that meet the conditions. If no subarray meets the conditions, return <code>0</code>.

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

&nbsp;
Example 1:

<pre>
Input: nums = [1,5,4,2,9,9,9], k = 3
Output: 15
Explanation: The subarrays of nums with length 3 are:
- [1,5,4] which meets the requirements and has a sum of 10.
- [5,4,2] which meets the requirements and has a sum of 11.
- [4,2,9] which meets the requirements and has a sum of 15.
- [2,9,9] which does not meet the requirements because the element 9 is repeated.
- [9,9,9] which does not meet the requirements because the element 9 is repeated.
We return 15 because it is the maximum subarray sum of all the subarrays that meet the conditions
</pre>

Example 2:

<pre>
Input: nums = [4,4,4], k = 3
Output: 0
Explanation: The subarrays of nums with length 3 are:
- [4,4,4] which does not meet the requirements because the element 4 is repeated.
We return 0 because no subarrays meet the conditions.
</pre>

&nbsp;
Constraints:

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

maximumSubarraySum

Maximum Sum of Distinct Subarrays With Length K

Max Consecutive Ones III

max-consecutive-ones-iii

最大连续1的个数 III

Longest Nice Subarray

longest-nice-subarray

最长优雅子数组

Optimal Partition of String

optimal-partition-of-string

子字符串的最优划分

Count the Number of Good Subarrays

count-the-number-of-good-subarrays

统计好子数组的数目

Maximum Good Subarray Sum

maximum-good-subarray-sum

最大好子数组和

Find the Power of K-Size Subarrays I

find-the-power-of-k-size-subarrays-i

长度为 K 的子数组的能量值 I

Find the Power of K-Size Subarrays II

find-the-power-of-k-size-subarrays-ii

长度为 K 的子数组的能量值 II

Array

Hash Table

Sliding Window

给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> 。请你从 <code>nums</code> 中满足下述条件的全部子数组中找出最大子数组和：

<ul>
	<li>子数组的长度是 <code>k</code>，且</li>
	<li>子数组中的所有元素 各不相同 。</li>
</ul>

返回满足题面要求的最大子数组和。如果不存在子数组满足这些条件，返回 <code>0</code> 。

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

&nbsp;

示例 1：

<pre>输入：nums = [1,5,4,2,9,9,9], k = 3
输出：15
解释：nums 中长度为 3 的子数组是：
- [1,5,4] 满足全部条件，和为 10 。
- [5,4,2] 满足全部条件，和为 11 。
- [4,2,9] 满足全部条件，和为 15 。
- [2,9,9] 不满足全部条件，因为元素 9 出现重复。
- [9,9,9] 不满足全部条件，因为元素 9 出现重复。
因为 15 是满足全部条件的所有子数组中的最大子数组和，所以返回 15 。
</pre>

示例 2：

<pre>输入：nums = [4,4,4], k = 3
输出：0
解释：nums 中长度为 3 的子数组是：
- [4,4,4] 不满足全部条件，因为元素 4 出现重复。
因为不存在满足全部条件的子数组，所以返回 0 。
</pre>

&nbsp;

提示：

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