maximum-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

Given an integer array <code>nums</code>, find the subarray with the largest sum, and return its sum.

&nbsp;
Example 1:

<pre>
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
</pre>

Example 2:

<pre>
Input: nums = [1]
Output: 1
Explanation: The subarray [1] has the largest sum 1.
</pre>

Example 3:

<pre>
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
</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>

&nbsp;
Follow up: If you have figured out the <code>O(n)</code> solution, try coding another solution using the divide and conquer approach, which is more subtle.

maxSubArray

Maximum Subarray

Best Time to Buy and Sell Stock

best-time-to-buy-and-sell-stock

买卖股票的最佳时机

Maximum Product Subarray

maximum-product-subarray

乘积最大子数组

Degree of an Array

degree-of-an-array

数组的度

Longest Turbulent Subarray

longest-turbulent-subarray

最长湍流子数组

Maximum Score Of Spliced Array

maximum-score-of-spliced-array

拼接数组的最大分数

Maximum Absolute Sum of Any Subarray

maximum-absolute-sum-of-any-subarray

任意子数组和的绝对值的最大值

Maximum Subarray Sum After One Operation

maximum-subarray-sum-after-one-operation

经过一次操作后的最大子数组和

Substring With Largest Variance

substring-with-largest-variance

最大波动的子字符串

Count Subarrays With Score Less Than K

count-subarrays-with-score-less-than-k

统计得分小于 K 的子数组数目

Maximum Value of a String in an Array

maximum-value-of-a-string-in-an-array

数组中字符串的最大值

Find the Substring With Maximum Cost

find-the-substring-with-maximum-cost

找到最大开销的子字符串

K Items With the Maximum Sum

k-items-with-the-maximum-sum

K 件物品的最大和

Maximum Good Subarray Sum

maximum-good-subarray-sum

最大好子数组和

Maximize Subarray Sum After Removing All Occurrences of One Element

maximize-subarray-sum-after-removing-all-occurrences-of-one-element

删除所有值为某个元素后的最大子数组和

Array

Divide and Conquer

Dynamic Programming

给你一个整数数组 <code>nums</code> ，请你找出一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。

子数组 是数组中的一个连续部分。

&nbsp;

示例 1：

<pre>
输入：nums = [-2,1,-3,4,-1,2,1,-5,4]
输出：6
解释：连续子数组&nbsp;[4,-1,2,1] 的和最大，为&nbsp;6 。
</pre>

示例 2：

<pre>
输入：nums = [1]
输出：1
</pre>

示例 3：

<pre>
输入：nums = [5,4,-1,7,8]
输出：23
</pre>

&nbsp;

提示：

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

&nbsp;

进阶：如果你已经实现复杂度为 <code>O(n)</code> 的解法，尝试使用更为精妙的 分治法 求解。