# leetcode-628-easy()-其他

## leetcode-628-easy()

Maximum Product of Three Numbers

``````Given an integer array nums, find three numbers whose product is maximum and return the maximum product.

Example 1:

Input: nums = [1,2,3]
Output: 6
Example 2:

Input: nums = [1,2,3,4]
Output: 24
Example 3:

Input: nums = [-1,-2,-3]
Output: -6
Constraints:

3 <= nums.length <= 104
-1000 <= nums[i] <= 1000
``````

• 在零轴中间
• 全部位于零轴左边
• 全部位于零轴右边

``````public int maximumProduct(int[] nums) {
Arrays.sort(nums);

int max = nums[0] * nums[1] * nums[nums.length - 1];
max = Math.max(nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3], max);

return max;
}
``````

————————

Maximum Product of Three Numbers

``````Given an integer array nums, find three numbers whose product is maximum and return the maximum product.

Example 1:

Input: nums = [1,2,3]
Output: 6
Example 2:

Input: nums = [1,2,3,4]
Output: 24
Example 3:

Input: nums = [-1,-2,-3]
Output: -6
Constraints:

3 <= nums.length <= 104
-1000 <= nums[i] <= 1000
``````

• 在零轴中间
• 全部位于零轴左边
• 全部位于零轴右边

``````public int maximumProduct(int[] nums) {
Arrays.sort(nums);

int max = nums[0] * nums[1] * nums[nums.length - 1];
max = Math.max(nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3], max);

return max;
}
``````