410 added

Author: aQua

Algorithms/0410.split-array-largest-sum/README.md

@@ -0,0 +1,31 @@
+# [410. Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)
+
+## 题目
+
+Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
+
+Note:
+If n is the length of array, assume the following constraints are satisfied:
+
+1. 1 ≤ n ≤ 1000
+1. 1 ≤ m ≤ min(50, n)
+
+Examples:
+
+```text
+Input:
+nums = [7,2,5,10,8]
+m = 2
+
+Output:
+18
+
+Explanation:
+There are four ways to split nums into two subarrays.
+The best way is to split it into [7,2,5] and [10,8],
+where the largest sum among the two subarrays is only 18.
+```
+
+## 解题思路
+
+见程序注释

Algorithms/0410.split-array-largest-sum/split-array-largest-sum.go

@@ -0,0 +1,7 @@
+package Problem0410
+
+func splitArray(nums []int, m int) int {
+	res :=
+
+	return res
+}

Algorithms/0410.split-array-largest-sum/split-array-largest-sum_test.go

@@ -0,0 +1,41 @@
+package Problem0410
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	nums []int
+	m    int
+	ans  int
+}{
+
+	{
+		[]int{7, 2, 5, 10, 8},
+		2,
+		18,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_splitArray(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, splitArray(tc.nums, tc.m), "输入:%v", tc)
+	}
+}
+
+func Benchmark_splitArray(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			splitArray(tc.nums, tc.m)
+		}
+	}
+}