【LeetCode】Maximum Product Subarray

Maximum Product Subarray
Total Accepted: 7579 Total Submissions: 47716 My Submissions Question Solution 
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.
【解题思路】
最大连续字数组乘积。和最大连续子数组和有点类似。
但是因为乘法的关系，负负得正，所有每次都需要求解当前的最大最小值。
每一步需要计算当前最大最小值*当前值，然后和当前值比较大小。

Java AC 428ms

public class Solution {
    public int maxProduct(int[] A) {
        int len = A.length;
        int max = A[0];
        int min = A[0];
        int temp1 = 0;
        int temp2 = 0;
        int result = A[0];
        for(int i = 1; i < len; i++){
            temp1 = min * A[i];
            temp2 = max * A[i];
            min = Math.min(Math.min(temp1, temp2), A[i]);
            max = Math.max(Math.max(temp1, temp2), A[i]);
            result = max > result ? max : result;
        }
        return result;
    }
}

Python AC 188ms

class Solution:
    # @param A, a list of integers
    # @return an integer
    def maxProduct(self, A):
        a_min = A[0]
        a_max = A[0]
        result = A[0]
        temp1 = 0
        temp2 = 0
        a_len = len(A)
        for i in range(1, a_len):
            temp1 = a_min * A[i]
            temp2 = a_max * A[i]
            a_min = min(min(temp1, temp2), A[i])
            a_max = max(max(temp1, temp2), A[i])
            result = a_max if a_max > result else result
        return result