Solution (leetcode-in-java 1.14 API)

java.lang.Object
- g0601_0700.s0628_maximum_product_of_three_numbers.Solution

```
public class Solution
extends Object
```
628 - Maximum Product of Three Numbers\. Easy 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 <= 10⁴ * `-1000 <= nums[i] <= 1000`

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int maximumProduct(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

maximumProduct

public int maximumProduct(int[] nums)