leetcode628: Maximum Product of Three Numbers

要求：

Given an integer array, find three numbers whose product is maximum and output the maximum product.

Example 1:

Input: [1,2,3]
Output: 6

Example 2:

Input: [1,2,3,4]
Output: 24

Note:

1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
2. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.

注意考虑两个负数乘一个正数这种情况。先排序在按正数*正数*正数 和 负数*负数*正数 这两种情况

	public int maximumProduct(int[] nums) {
		ArrayList list = new ArrayList();
		for (int i = 0; i < nums.length; i++)
			list.add(nums[i]);
		list.sort(null);
		int a = (int) list.get(list.size() - 1) * (int) list.get(list.size() - 2) * (int) list.get(list.size() - 3);
		int b = (int) list.get(list.size() - 1) * (int) list.get(0) * (int) list.get(1);
		if (a > b)
			return a;
		return b;
	}