mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
32 lines
1.0 KiB
HTML
32 lines
1.0 KiB
HTML
<p>Given an integer array <code>nums</code>, find a contiguous non-empty subarray within the array that has the largest product, and return <em>the product</em>.</p>
|
|
|
|
<p>The test cases are generated so that the answer will fit in a <strong>32-bit</strong> integer.</p>
|
|
|
|
<p>A <strong>subarray</strong> is a contiguous subsequence of the array.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,3,-2,4]
|
|
<strong>Output:</strong> 6
|
|
<strong>Explanation:</strong> [2,3] has the largest product 6.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-2,0,-1]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> The result cannot be 2, because [-2,-1] is not a subarray.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>-10 <= nums[i] <= 10</code></li>
|
|
<li>The product of any prefix or suffix of <code>nums</code> is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> integer.</li>
|
|
</ul>
|