maximum-absolute-sum-of-any-subarray

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>. The absolute sum of a subarray <code>[numsl, numsl+1, ..., numsr-1, numsr]</code> is <code>abs(numsl + numsl+1 + ... + numsr-1 + numsr)</code>.

Return the maximum absolute sum of any (possibly empty) subarray of <code>nums</code>.

Note that <code>abs(x)</code> is defined as follows:

<ul>
	<li>If <code>x</code> is a negative integer, then <code>abs(x) = -x</code>.</li>
	<li>If <code>x</code> is a non-negative integer, then <code>abs(x) = x</code>.</li>
</ul>

&nbsp;
Example 1:

<pre>
Input: nums = [1,-3,2,3,-4]
Output: 5
Explanation: The subarray [2,3] has absolute sum = abs(2+3) = abs(5) = 5.
</pre>

Example 2:

<pre>
Input: nums = [2,-5,1,-4,3,-2]
Output: 8
Explanation: The subarray [-5,1,-4] has absolute sum = abs(-5+1-4) = abs(-8) = 8.
</pre>

&nbsp;
Constraints:

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

maxAbsoluteSum

Maximum Absolute Sum of Any Subarray

Maximum Subarray

maximum-subarray

最大子数组和

Array

Dynamic Programming

给你一个整数数组 <code>nums</code> 。一个子数组 <code>[numsl, numsl+1, ..., numsr-1, numsr]</code> 的 和的绝对值 为 <code>abs(numsl + numsl+1 + ... + numsr-1 + numsr)</code> 。

请你找出 <code>nums</code> 中 和的绝对值 最大的任意子数组（可能为空），并返回该 最大值 。

<code>abs(x)</code> 定义如下：

<ul>
	<li>如果 <code>x</code> 是负整数，那么 <code>abs(x) = -x</code> 。</li>
	<li>如果 <code>x</code> 是非负整数，那么 <code>abs(x) = x</code> 。</li>
</ul>

 

示例 1：

<pre>
输入：nums = [1,-3,2,3,-4]
输出：5
解释：子数组 [2,3] 和的绝对值最大，为 abs(2+3) = abs(5) = 5 。
</pre>

示例 2：

<pre>
输入：nums = [2,-5,1,-4,3,-2]
输出：8
解释：子数组 [-5,1,-4] 和的绝对值最大，为 abs(-5+1-4) = abs(-8) = 8 。
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 105</code></li>
	<li><code>-104 <= nums[i] <= 104</code></li>
</ul>