628. 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 class Solution {
    public int MaximumProduct(int[] nums) {
		Array.Sort(nums);
		int length = nums.Length;
		int a = nums[0] * nums[1] * nums[length - 1];
		int b = nums[length - 1] * nums[length - 2] * nums[length - 3];
		return a > b ? a : b;
    }
}

null