码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode Maximum Product Subarray

时间:2014-10-09 01:08:37      阅读:231      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   io   ar   for   sp   div   c   

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.

子数组乘积最大

class Solution {
public:
    int maxProduct(int A[], int n) {
        if(n < 1) return 0;
        int minv = A[0], maxv = A[0], res = A[0];
        for(int i = 1 ; i < n; ++ i){
            int tmpMin = min(minv*A[i],maxv*A[i]);
            int tmpMax = max(minv*A[i],maxv*A[i]);
            minv = min(tmpMin,A[i]);
            maxv = max(tmpMax,A[i]);
            res=max(maxv,res);
        }
        return res;
    
};

 

Leetcode Maximum Product Subarray

标签:style   blog   color   io   ar   for   sp   div   c   

原文地址:http://www.cnblogs.com/xiongqiangcs/p/4011538.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!