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

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String input = sc.nextLine();
int[] x = new int[input.length()];
char[] c = input.toCharArray();
int y = 0;
for (char d : c) {
x[y] = Integer.parseInt(String.valueOf(d));
y++;
}
insertSort(x);
//      for (int i : x) {
//			System.out.print(i+",");
//		}
int temp = 1;
for(int a=x.length-3;a<x.length; a++){
temp *= x[a];
}
System.out.println(temp);
}
//插入排序
public static void insertSort(int[] a){
int temp = 0 ,j;
for (int i = 1; i < a.length; i++){
if (a[i - 1] > a[i]){
temp = a[i];
j = i;
while (j > 0 && a[j - 1] > temp){
a[j] = a[j - 1];
j--;
}
a[j] = temp;
}
}
}

}