LeetCode动态规划乘积最大子数组

最新推荐文章于 2022-10-20 02:50:43 发布

江南路漫

最新推荐文章于 2022-10-20 02:50:43 发布

阅读量68

点赞数

分类专栏： LeetCode 动态规划

本文链接：https://blog.csdn.net/ucler/article/details/119206333

版权

动态规划数组处理最大子数组乘积算法

关键词由CSDN通过智能技术生成

LeetCode 同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

动态规划

21 篇文章 0 订阅

订阅专栏

Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
It is guaranteed that the answer will fit in a 32-bit integer.
A subarray is a contiguous subsequence of the array.

动态转移方程
maxn = max(nums[i], nums[i] * maxn)
minn = min(nums[i], nums[i] * minn)

边界条件
maxn = 1, minn = 1

代码

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int len = nums.size();
        int maxn = 1, minn = 1;
        int res = nums[0];

        for(int i = 0; i < len; i++)
        {
            if(nums[i] < 0)
            swap(maxn, minn);
            
            maxn = max(nums[i], nums[i] * maxn);
            minn = min(nums[i], nums[i] * minn);
            
            if(res < maxn)
            res = maxn;
        }
        return res;

    }
};