给出一个整数数组,找出任何三个整数的最大产量.例如,如果输入数组是 [1,2,3,4],最大产量是24 (子序是 [2,3,4]).
写出这个问题的java解决方案.
Here's the JAVA code to solve the given problem:

```
public static int maximumProduct(int[] nums) {
    int n = nums.length;
    Arrays.sort(nums);
    int max1 = nums[n-1] * nums[n-2] * nums[n-3];
    int max2 = nums[0] * nums[1] * nums[n-1];
    return Math.max(max1, max2);
}
```

Explanation:

1. We first sort the input array in ascending order.
2. We then find two possible maximum product values:
   * max1: Product of last three integers in the sorted array (as they will be the largest).
   * max2: Product of first two integers and last integer in the sorted array (as first two integers could be negative and last integer could be the largest).
3. We return the maximum of the two values (max1 and max2) as our final result.

Hope this helps!