Leetcode: Maximum Product Subarray

最新推荐文章于 2019-01-11 00:33:27 发布

LuckySeven7777

最新推荐文章于 2019-01-11 00:33:27 发布

阅读量339

点赞数

CC 4.0 BY-SA版权

分类专栏： Java学习

本文链接：https://blog.youkuaiyun.com/LuckySeven7777/article/details/43144403

Java学习专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种求解最大连续子数组乘积的方法。针对包含至少一个数的数组，寻找具有最大乘积的连续子数组。通过示例说明算法实现，并提供了完整的Java代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem:

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],
the contiguous subarray [2,3] has the largest product = 6.

Solution:

See some examples first.

public class Solution {
    public int maxProduct(int[] A) {
        if (A.length == 1) {
            return A[0];
        }
        int result = A[0]; // must be assigned A[0] (but not Integer.VALUE_MIN) in case A[0] is the largest product.
        int maxProduct = A[0]; // local maxProduct
        int minProduct = A[0]; // local minProduct
        for (int i = 1; i < A.length; i++) {
            int tmp = maxProduct;
            maxProduct = Math.max(Math.max(maxProduct * A[i], A[i]), minProduct * A[i]);
            minProduct = Math.min(Math.min(tmp * A[i], A[i]), minProduct * A[i]);
            if (maxProduct > result) {
                result = maxProduct;
            }
        }
        return result;
    }
}