filmov
tv
Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm

Показать описание
Given an integer array `nums`, 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.
OR
Given an integer array with negative numbers and zero find the subarray with maximum product, i.e. find the contiguous array elements that produce maximum product.
The test cases are generated so that the answer will fit in a **32-bit** integer.
OR
Given an integer array with negative numbers and zero find the subarray with maximum product, i.e. find the contiguous array elements that produce maximum product.