动态规划——乘积最大子序列

题目链接：http://www.lintcode.com/zh-cn/problem/maximum-product-subarray/

参考资料：http://blog.csdn.net/wzy_1988/article/details/9319897

                    https://www.bbsmax.com/A/A7zgX6KKJ4/

public class MaximumProductSubarray {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}
	
	public int maxProduct(int[] nums){
		if(nums==null||nums.length==0)
			return 0;
		int subMax[]=new int[nums.length];
		int subMin[]=new int[nums.length];
		subMax[0]=nums[0];
		subMin[0]=nums[0];
		int res=nums[0];
		for(int i=1;i<nums.length;i++){
			subMax[i]=Math.max(Math.max(nums[i],subMax[i-1]*nums[i]),subMin[i-1]*nums[i]);
			subMin[i]=Math.min(Math.min(nums[i],subMax[i-1]*nums[i]),subMin[i-1]*nums[i]);
			
			res=Math.max(res,subMax[i]);
		}
		return res;
	}

}