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

Java:

http://blog.csdn.net/linhuanmars/article/details/39537283

</pre><pre name="code" class="java">public int maxProduct(int[] A) {
    if(A==null || A.length==0)
        return 0;
    if(A.length == 1)
        return A[0];
    int max_local = A[0];
    int min_local = A[0];
    int global = A[0];
    for(int i=1;i<A.length;i++)
    {
        int max_copy = max_local;
        max_local = Math.max(Math.max(A[i]*max_local, A[i]), A[i]*min_local);
        min_local = Math.min(Math.min(A[i]*max_copy, A[i]), A[i]*min_local);
        global = Math.max(global, max_local);
    }
    return global;
}

略改：

public class Solution {
    public int maxProduct(int[] A) {
       if(A==null|A.length==0) return 0;
       if(A.length==1)return A[0];
       int max_local=A[0];
       int min_local=A[0];
       int global=A[0];
       for(int i=1;i<A.length;i++)
       {
           int min_copy=min_local;
           min_local=Math.min(Math.min(A[i]*min_local,A[i]),A[i]*max_local);
           max_local=Math.max(Math.max(A[i]*min_copy,A[i]),A[i]*max_local);
           global=Math.max(global,max_local);
       }
       return global;
    }
}