資訊專欄INFORMATION COLUMN
Problem
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:
The length of the given array will be in range [3,10^4] and all elements are in the range [-1000, 1000].
Multiplication of any three numbers in the input won"t exceed the range of 32-bit signed integer.
class Solution {
public int maximumProduct(int[] nums) {
int len = nums.length;
if (len < 3) return 0;
Arrays.sort(nums);
if (nums[0]*nums[len-1] >= 0) {
return nums[len-1]*nums[len-2]*nums[len-3];
}
int l = 0, r = len-1, res = 1, count = 3;
while (count > 0) {
if (count%2 == 1) {
res *= nums[r];
r -= 1;
count -= 1;
}
else {
if (nums[r]*nums[r-1] > nums[l]*nums[l+1]) {
res *= nums[r]*nums[r-1];
r -= 2;
} else {
res *= nums[l]*nums[l+1];
l += 2;
}
count -= 2;
}
}
return res;
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/72091.html
摘要：題目詳情輸入一個(gè)大小大于等于三的數(shù)組，給出其中任意三個(gè)數(shù)乘積中的最大乘積想法這道題最主要的是要考慮正負(fù)數(shù)的情況。如果全都是正數(shù)相乘比較大，就取三個(gè)最大值相乘即可。 題目詳情 Given an integer array, find three numbers whose product is maximum and output the maximum product.輸入一個(gè)大小大于...
摘要：前言從開始寫相關(guān)的博客到現(xiàn)在也蠻多篇了。而且當(dāng)時(shí)也沒有按順序?qū)懍F(xiàn)在翻起來覺得蠻亂的。可能大家看著也非常不方便。所以在這里做個(gè)索引嘻嘻。順序整理更新更新更新更新更新更新更新更新更新更新更新更新更新更新更新更新 前言 從開始寫leetcode相關(guān)的博客到現(xiàn)在也蠻多篇了。而且當(dāng)時(shí)也沒有按順序?qū)憽F(xiàn)在翻起來覺得蠻亂的?？赡艽蠹铱粗卜浅２环奖?。所以在這里做個(gè)索引嘻嘻。 順序整理 1~50 1...
摘要：在線網(wǎng)站地址我的微信公眾號(hào)完整題目列表從年月日起，每天更新一題，順序從易到難，目前已更新個(gè)題。這是項(xiàng)目地址歡迎一起交流學(xué)習(xí)。 這篇文章記錄我練習(xí)的 LeetCode 題目，語言 JavaScript。 在線網(wǎng)站：https://cattle.w3fun.com GitHub 地址：https://github.com/swpuLeo/ca...我的微信公眾號(hào)： showImg(htt...
Problem Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest palindrome mod 1337. Example Input: 2Output: 987Ex...
Problem Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribu...
閱讀 3156·2021-10-08 10:04
閱讀 1098·2021-09-30 09:48
閱讀 3466·2021-09-22 10:53
閱讀 1684·2021-09-10 11:22
閱讀 1697·2021-09-06 15:00
閱讀 2156·2019-08-30 15:56
閱讀 719·2019-08-30 15:53
閱讀 2288·2019-08-30 13:04
