Skip to content

Commit a44cfd2

Browse files
refactor 628
1 parent d0be0dc commit a44cfd2

File tree

1 file changed

+0
-16
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-16
lines changed

src/main/java/com/fishercoder/solutions/_628.java

Lines changed: 0 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -2,22 +2,6 @@
22

33
import java.util.Arrays;
44

5-
/**
6-
* 628. Maximum Product of Three Numbers
7-
*
8-
* Given an integer array, find three numbers whose product is maximum and output the maximum product.
9-
Example 1:
10-
Input: [1,2,3]
11-
Output: 6
12-
13-
Example 2:
14-
Input: [1,2,3,4]
15-
Output: 24
16-
17-
Note:
18-
The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
19-
Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer.
20-
*/
215
public class _628 {
226

237
public static class Solution1 {

0 commit comments

Comments
 (0)