LeetCode——Maximum Product Subarray

标签：leetcode

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.

求数组中的最大连续乘积。

	public int maxProduct(int[] A) {
		if (A == null || A.length == 0)
			return 0;
		int max = A[0], min = A[0], result = A[0];
		for (int i = 1; i < A.length; i++) {
			int inner_max = max;
			max = Math.max(Math.max(max * A[i], A[i]), min * A[i]);
			min = Math.min(Math.min(inner_max * A[i], A[i]), min * A[i]);
			result = Math.max(max, result);
		}
		return result;
	}

LeetCode——Maximum Product Subarray

标签：leetcode

原文地址：http://blog.csdn.net/laozhaokun/article/details/41355317