628 accepted

Author: aQua

Algorithms/0628.maximum-product-of-three-numbers/README.md

@@ -1,7 +1,23 @@
 # [628. Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)
 
 ## 题目
+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,104] 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.
 
 ## 解题思路
 

Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers.go

@@ -1,2 +1,22 @@
 package Problem0628
 
+import (
+	"sort"
+)
+
+func maximumProduct(nums []int) int {
+	sort.Ints(nums)
+	l := len(nums)
+	temp := append(nums[l-3:], nums[:3]...)
+
+	max := nums[0] * nums[1] * nums[2]
+
+	for i := 0; i < len(temp)-3; i++ {
+		t := temp[i] * temp[i+1] * temp[i+2]
+		if max < t {
+			max = t
+		}
+	}
+
+	return max
+}

Algorithms/0628.maximum-product-of-three-numbers/maximum-product-of-three-numbers_test.go

@@ -1,8 +1,8 @@
 package Problem0628
 
 import (
-	"testing"
 	"fmt"
+	"testing"
 
 	"github.com/stretchr/testify/assert"
 )
@@ -15,32 +15,35 @@ type question struct {
 // para 是参数
 // one 代表第一个参数
 type para struct {
-	one string
+	one []int
 }
 
 // ans 是答案
 // one 代表第一个答案
 type ans struct {
-	one string
+	one int
 }
 
 func Test_Problem0628(t *testing.T) {
 	ast := assert.New(t)
 
 	qs := []question{
-
 		question{
-			para{""},
-			ans{""},
+			para{[]int{-4, -3, -2, -1, 60}},
+			ans{720},
 		},
-	
+		question{
+			para{[]int{1, 2, 3, 4}},
+			ans{24},
+		},
+
 		// 如需多个测试，可以复制上方元素。
 	}
 
 	for _, q := range qs {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%v", p)
+		ast.Equal(a.one, maximumProduct(p.one), "输入:%v", p)
 	}
 }