给定一个无序数组，包含正数、负数和0，要求从中找出3个数的乘积，使得乘积最大 java实现

实现该算法主要思想是，

package com.meituan.test;

public class Test {

public static void main(String[] args) {

int[] arr = { -10, -1, 0, 2, 34, 1, 10, 8, 9 };

getMax(arr);

}

public static void getMax(int[] arr) {

int max = 1, second_max = 1, third_max = 1;

int min = 1, second_min = 1;

for (int i = 0; i < arr.length; i++) {

	if (max < arr[i]) {

third_max = second_max;

second_max = max;

max = arr[i];

} else if (second_max < arr[i]) {

third_max = second_max;

second_max = arr[i];

} else if (third_max < arr[i]) {

third_max = arr[i];

} else if (arr[i] < min) {

second_min = min;

min = arr[i];

} else if (arr[i] < second_min) {

second_min = arr[i];

}

}

int max1=max*second_max*third_max;

int max2=max*second_min*min;

if(max1>=max2){

	System.out.println("max:"+max+"  second_max:"+second_max+" third_max:"+third_max+"   result:"+max1);

}else{

	System.out.println("max:"+max+"  second_min:"+second_min+" min:"+min+"   result:"+max2);

}

}

}

结果：