Leetcode Maximum Product Subarray

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 < ) return ;

        int minv = A[], maxv = A[], res = A[];

        for(int i =  ; 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

最新文章

热门文章