Maximum Product Subarray

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

yyfly22

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

阅读量218

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode array dynamic programming Maximum Product Suba

本文链接：https://blog.youkuaiyun.com/u012309913/article/details/55045492

LeetCode 专栏收录该内容

71 篇文章

订阅专栏

这道LeetCode题目要求找到数组中乘积最大的连续子数组。例如，在数组[-2, 0, -1, 3, -3, 2]中，子数组[-2, -1, 3, -3]的乘积为6。解题关键在于同时跟踪局部最大值和最小值，以应对可能存在的负数情况。" 80569910,7505796,Android开发：深入理解AsyncTask,"['Android开发', '异步处理', '网络请求', '权限控制']

摘要生成于 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.

Subscribe to see which companies asked this question.

解析：由于可能存在负数的情况，每次应该保存局部最大和局部最小，以及全局最大值

class Solution {
public:
   int maxint(int a, int b) {
       if (a > b) return a;
       return b;
   }
   
   int minint(int a, int b) {
       if (a < b) return a;
       return b;
   }
   
    int maxProduct(vector<int>& nums) {
        int len = nums.size();
        if (len == 1) return nums[0];
        
        int min_tmp = nums[0];
        int max_tmp = nums[0];
        int max_product = nums[0];
        for (int i = 1; i < len; ++i)
        {
            int a = min_tmp * nums[i];
            int b = max_tmp * nums[i];
            max_tmp = maxint(maxint(a, b), nums[i]);
            min_tmp = minint(minint(a, b), nums[i]);
            
            max_product = maxint(max_product, max_tmp);
        }
        
        return max_product;
    }
};