class Solution {
public:
int maximumProduct(vector& nums) {
int len = nums.size();
sort(nums.begin(),nums.end());
return max(nums[0] * nums[1] * nums[len-1],nums[len-1] * nums[len-2] * nums[len-3]);
}
};
看了题解，想不到哦~~
淦
