643 通过单元测试

Author: aQua

Algorithms/0643.maximum-average-subarray-i/README.md

@@ -1,7 +1,17 @@
 # [643. Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)
 
 ## 题目
+Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.
 
+Example 1:
+```
+Input: [1,12,-5,-6,50,3], k = 4
+Output: 12.75
+Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75
+```
+Note:
+1 <= k <= n <= 30,000.
+Elements of the given array will be in the range [-10,000, 10,000].
 
 ## 解题思路
 

Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i.go

@@ -1,2 +1,17 @@
 package Problem0643
 
+func findMaxAverage(nums []int, k int) float64 {
+	max := 0
+
+	for i := 0; i+k-1 < len(nums); i++ {
+		temp := 0
+		for j := i; j < i+k; j++ {
+			temp += nums[j]
+		}
+		if max < temp {
+			max = temp
+		}
+	}
+
+	return float64(max) / float64(k)
+}

Algorithms/0643.maximum-average-subarray-i/maximum-average-subarray-i_test.go

@@ -1,8 +1,8 @@
 package Problem0643
 
 import (
-	"testing"
 	"fmt"
+	"testing"
 
 	"github.com/stretchr/testify/assert"
 )
@@ -15,13 +15,14 @@ type question struct {
 // para 是参数
 // one 代表第一个参数
 type para struct {
-	one string
+	nums []int
+	k    int
 }
 
 // ans 是答案
 // one 代表第一个答案
 type ans struct {
-	one string
+	one float64
 }
 
 func Test_Problem0643(t *testing.T) {
@@ -30,17 +31,17 @@ func Test_Problem0643(t *testing.T) {
 	qs := []question{
 
 		question{
-			para{""},
-			ans{""},
+			para{[]int{1, 12, -5, -6, 50, 3}, 4},
+			ans{12.75},
 		},
-	
+
 		// 如需多个测试，可以复制上方元素。
 	}
 
 	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, findMaxAverage(p.nums, p.k), "输入:%v", p)
 	}
 }