maximum-good-subarray-sum

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> of length <code>n</code> and a positive integer <code>k</code>.

A subarray of <code>nums</code> is called good if the absolute difference between its first and last element is exactly <code>k</code>, in other words, the subarray <code>nums[i..j]</code> is good if <code>|nums[i] - nums[j]| == k</code>.

Return the maximum sum of a good subarray of <code>nums</code>. If there are no good subarrays, return <code>0</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,3,4,5,6], k = 1
Output: 11
Explanation: The absolute difference between the first and last element must be 1 for a good subarray. All the good subarrays are: [1,2], [2,3], [3,4], [4,5], and [5,6]. The maximum subarray sum is 11 for the subarray [5,6].
</pre>

Example 2:

<pre>
Input: nums = [-1,3,2,4,5], k = 3
Output: 11
Explanation: The absolute difference between the first and last element must be 3 for a good subarray. All the good subarrays are: [-1,3,2], and [2,4,5]. The maximum subarray sum is 11 for the subarray [2,4,5].
</pre>

Example 3:

<pre>
Input: nums = [-1,-2,-3,-4], k = 2
Output: -6
Explanation: The absolute difference between the first and last element must be 2 for a good subarray. All the good subarrays are: [-1,-2,-3], and [-2,-3,-4]. The maximum subarray sum is -6 for the subarray [-1,-2,-3].
</pre>

&nbsp;
Constraints:

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

maximumSubarraySum

Maximum Good Subarray Sum

Maximum Subarray

maximum-subarray

最大子数组和

Maximum Sum of Distinct Subarrays With Length K

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

长度为 K 子数组中的最大和

Array

Hash Table

Prefix Sum

给你一个长度为 <code>n</code>&nbsp;的数组&nbsp;<code>nums</code>&nbsp;和一个 正&nbsp;整数&nbsp;<code>k</code>&nbsp;。

如果&nbsp;<code>nums</code>&nbsp;的一个子数组中，第一个元素和最后一个元素 差的绝对值恰好&nbsp;为&nbsp;<code>k</code>&nbsp;，我们称这个子数组为&nbsp;好&nbsp;的。换句话说，如果子数组&nbsp;<code>nums[i..j]</code>&nbsp;满足&nbsp;<code>|nums[i] - nums[j]| == k</code>&nbsp;，那么它是一个好子数组。

请你返回&nbsp;<code>nums</code>&nbsp;中&nbsp;好&nbsp;子数组的&nbsp;最大&nbsp;和，如果没有好子数组，返回&nbsp;<code>0</code>&nbsp;。

&nbsp;

示例 1：

<pre>
输入：nums = [1,2,3,4,5,6], k = 1
输出：11
解释：好子数组中第一个元素和最后一个元素的差的绝对值必须为 1 。好子数组有 [1,2] ，[2,3] ，[3,4] ，[4,5] 和 [5,6] 。最大子数组和为 11 ，对应的子数组为 [5,6] 。
</pre>

示例 2：

<pre>
输入：nums = [-1,3,2,4,5], k = 3
输出：11
解释：好子数组中第一个元素和最后一个元素的差的绝对值必须为 3 。好子数组有 [-1,3,2] 和 [2,4,5] 。最大子数组和为 11 ，对应的子数组为 [2,4,5] 。
</pre>

示例 3：

<pre>
输入：nums = [-1,-2,-3,-4], k = 2
输出：-6
解释：好子数组中第一个元素和最后一个元素的差的绝对值必须为 2 。好子数组有 [-1,-2,-3] 和 [-2,-3,-4] 。最大子数组和为 -6 ，对应的子数组为 [-1,-2,-3] 。
</pre>

&nbsp;

提示：

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