# 628.Maximum Product of Three Numbers

**628.Maximum Product of Three Numbers**

难度:Easy

> 给定一个整型数组，在数组中找出由三个数组成的最大乘积，并输出这个乘积。

```
示例 1:

输入: [1,2,3]
输出: 6
示例 2:

输入: [1,2,3,4]
输出: 24
注意:

给定的整型数组长度范围是[3,104]，数组中所有的元素范围是[-1000, 1000]。
输入的数组中任意三个数的乘积不会超出32位有符号整数的范围。
```

最直观的方法，直接排序，找出绝对值最大的即可。时间复杂度是O(nlogn)。

```
class Solution {
public:
    int maximumProduct(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        return max(nums[0]*nums[1]*nums[nums.size()-1], nums[nums.size()-1]*nums[nums.size()-2]*nums[nums.size()-3]);
    }
};
```

> 执行用时 :128 ms, 在所有 C++ 提交中击败了13.28%的用户\
> 内存消耗 :10.7 MB, 在所有 C++ 提交中击败了92.19%的用户


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/628.maximum_product_of_three_numbers.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.