【LeetCode刷题Java版】Maximum Product Subarray

浏览数：213 / 时间：2015年06月08日

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.

package com.liuhao.acm.leetcode;

/**
 * @author liuhao 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 class MaximumProductSubarray {

	public static int maxProduct(int[] A) {
		int len = A.length;

		if (len <= 0) {
			return 0;
		}

		if (len == 1) {
			return A[0];
		}

		int max = A[0];
		int min = A[0];
		int result = A[0];

		for (int i = 1; i < len; i++) {
			int max_temp = max * A[i];
			int min_temp = min * A[i];
			max = Math.max(A[i], Math.max(max_temp, min_temp));
			min = Math.min(A[i], Math.min(max_temp, min_temp));
			result = Math.max(result, max);
		}

		return result;
	}

	public static void main(String[] args) {
		int[] a = new int[] { -4,-3 };
		System.out.println(maxProduct(a));
	}

}

郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。

【LeetCode刷题Java版】Maximum Product Subarray