[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.

Similar to finding the largest sum of continuous subsequences, multiplication also involves symbols. It is easier to maintain the maximum and minimum product of the current element at the same time.

 1 class Solution { 2 public: 3     int maxProduct(int A[], int n) { 4          5         int max_ending_here = A[0]; 6         int min_ending_here = A[0]; 7          8         int max_so_far = A[0]; 9         10         for (int i = 1; i < n; ++i) {11             int p_max = A[i] * max_ending_here;12             int p_min = A[i] * min_ending_here;13             14             max_ending_here = max(A[i], max(p_max, p_min));15             min_ending_here = min(A[i], min(p_max, p_min));16             17             max_so_far = max(max_so_far, max_ending_here);18         }19         20         return max_so_far;21     }22 };

 

[Leetcode] Maximum Product subarray