maximum-product-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 a subarray that has the largest product, and return the product.

The test cases are generated so that the answer will fit in a 32-bit integer.

&nbsp;
Example 1:

<pre>
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
</pre>

Example 2:

<pre>
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 104</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li>The product of any subarray of <code>nums</code> is guaranteed to fit in a 32-bit integer.</li>
</ul>

maxProduct

Maximum Product Subarray

Maximum Subarray

maximum-subarray

最大子数组和

House Robber

house-robber

打家劫舍

Product of Array Except Self

product-of-array-except-self

除自身以外数组的乘积

Maximum Product of Three Numbers

maximum-product-of-three-numbers

三个数的最大乘积

Subarray Product Less Than K

subarray-product-less-than-k

乘积小于 K 的子数组

Array

Dynamic Programming

给你一个整数数组 <code>nums</code>&nbsp;，请你找出数组中乘积最大的非空连续 子数组（该子数组中至少包含一个数字），并返回该子数组所对应的乘积。

测试用例的答案是一个&nbsp;32-位 整数。

&nbsp;

示例 1:

<pre>
输入: nums = [2,3,-2,4]
输出: <code>6</code>
解释:&nbsp;子数组 [2,3] 有最大乘积 6。
</pre>

示例 2:

<pre>
输入: nums = [-2,0,-1]
输出: 0
解释:&nbsp;结果不能为 2, 因为 [-2,-1] 不是子数组。</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 104</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li><code>nums</code> 的任何子数组的乘积都 保证&nbsp;是一个 32-位 整数</li>
</ul>