class Solution {
public int maximumProduct(int[] nums) {
Arrays.sort(nums); //排序
int t=nums.length;
return Math.max(nums[t-1]*nums[t-2]*nums[t-3],nums[0]*nums[1]*nums[t-1]);
}
}
leetcode 628 Maximum Product of Three Numbers
最新推荐文章于 2024-10-16 10:13:45 发布