Maximum Product Subarray

最新推荐文章于 2024-01-07 09:06:21 发布

爱折腾的猫

最新推荐文章于 2024-01-07 09:06:21 发布

阅读量4.5k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode C/C++

本文链接：https://blog.youkuaiyun.com/guang09080908/article/details/44457663

LeetCode 同时被 2 个专栏收录

62 篇文章

订阅专栏

C/C++

60 篇文章

订阅专栏

本文介绍了一种求解最大子串乘积的算法，并通过动态规划实现了具体代码。该算法能够找出数组中乘积最大的连续子数组。

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

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.
最大子串的乘积，主要是用到了动态规划的算法。C++ Code 如下：

class Solution {
public:
    int maxProduct(int a[], int n) {
    int *max = new int[n];
    int *min = new int[n];

    max[0] = a[0];
    min[0] = a[0];

    int product = max[0];

    for (int i=1; i<n; i++)
    {
        max[i] = MaxinThree(a[i], a[i]*max[i-1], a[i]*min[i-1]);  
        min[i] = MininThree(a[i], a[i]*max[i-1], a[i]*min[i-1]);   

        if (max[i] > product)
            product = max[i];
    }

    delete [] max;
    delete [] min;

    return product;


    }

    int MaxinThree(int num1, int num2, int num3)
    {
        int temp = num1 > num2 ? num1 : num2;
        return temp > num3 ? temp: num3;
    }

    int MininThree(int num1, int num2, int num3)
    {
        int temp = num1 < num2 ? num1 : num2;
        return temp < num3 ? temp: num3;
    }



};