找出数组中的最大连续乘积子串

用动态规划解决

<span style="white-space:pre">	</span>public static double Max(double a, double b, double c) {
		double d = (a > b) ? a : b;
		return (d > c) ? d : c;
	}
	public static double Min(double a, double b, double c) {
		double d = (a > b) ? b : a;
		return (d > c) ? c : d;
	}
	public static void main(String[] args) {
		double[] a = { -2.5, 4, 0, 3, 0.5, 8, -1 };
		double[] max = new double[a.length];  //保存当前连续乘积最大值
		double[] min = new double[a.length];   //保存当前连续乘积最小值
		double maxvalue = a[0];   //用它来保存乘积最大值
		max[0] = a[0];
		min[0] = a[0];
		for (int i = 1; i < a.length; i++) {
			max[i] = Max(a[i], a[i] * max[i - 1], a[i] * min[i - 1]);
			min[i] = Min(a[i], a[i] * max[i - 1], a[i] * min[i - 1]);
			if (max[i] > maxvalue) {
				maxvalue = max[i];
			}
		}
		System.out.println(maxvalue);
	}