[E:59/533, M:57/974, H:6/387] add No: 561 Array Partition I

Author: gladmo

questions/serial/简单/561/README.md

@@ -0,0 +1,56 @@
+## [数组拆分 I](https://leetcode-cn.com/problems/array-partition-i/)
+
+给定长度为 `2n`****的整数数组 `nums` ，你的任务是将这些数分成 `n` **** 对, 例如 `(a
+1
+, b
+1
+), (a
+2
+, b
+2
+), ..., (a
+n
+, b
+n
+)` ，使得从 `1` 到 `n` 的 `min(a
+i
+, b
+i
+)` 总和最大。
+
+返回该 **最大总和** 。
+
+ 
+
+**示例 1：**
+
+`
+**输入：**nums = [1,4,3,2]
+**输出：**4
+**解释：**所有可能的分法（忽略元素顺序）为：
+1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
+2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
+3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
+所以最大总和为 4`
+
+**示例 2：**
+
+`
+**输入：**nums = [6,2,6,5,1,2]
+**输出：**9
+**解释：**最优的分法为 (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9
+`
+
+ 
+
+**提示：**
+
+*   `1 
+4
+`
+*   `nums.length == 2 * n`
+*   `-10
+4
+ 
+4
+`

questions/serial/简单/561/golang/main.go

@@ -0,0 +1,62 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/561/golang/solution"
+)
+
+func main() {
+	/*
+
+		[1,4,3,2]
+
+	*/
+
+	tests := []struct {
+		name  string
+		input []int
+		want  int
+	}{
+		{
+			name:  "test-[1,4,3,2]",
+			input: []int{1, 4, 3, 2},
+			want:  4,
+		},
+		{
+			name:  "test-[6,2,6,5,1,2]",
+			input: []int{6, 2, 6, 5, 1, 2},
+			want:  9,
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/serial/简单/561/golang/solution/array-partition-i.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return arrayPairSum(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func arrayPairSum(nums []int) int {
+
+}

questions/serial/简单/561/golang/solution/array-partition-i.go.clean

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return arrayPairSum(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func arrayPairSum(nums []int) int {
+
+}

questions/store.json

@@ -0,0 +1,56 @@
+## [数组拆分 I](https://leetcode-cn.com/problems/array-partition-i/)
+
+给定长度为 `2n`****的整数数组 `nums` ，你的任务是将这些数分成 `n` **** 对, 例如 `(a
+1
+, b
+1
+), (a
+2
+, b
+2
+), ..., (a
+n
+, b
+n
+)` ，使得从 `1` 到 `n` 的 `min(a
+i
+, b
+i
+)` 总和最大。
+
+返回该 **最大总和** 。
+
+ 
+
+**示例 1：**
+
+`
+**输入：**nums = [1,4,3,2]
+**输出：**4
+**解释：**所有可能的分法（忽略元素顺序）为：
+1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
+2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
+3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
+所以最大总和为 4`
+
+**示例 2：**
+
+`
+**输入：**nums = [6,2,6,5,1,2]
+**输出：**9
+**解释：**最优的分法为 (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9
+`
+
+ 
+
+**提示：**
+
+*   `1 
+4
+`
+*   `nums.length == 2 * n`
+*   `-10
+4
+ 
+4
+`

questions/tags/数组/简单/array-partition-i/README.md

@@ -0,0 +1,62 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/561/golang/solution"
+)
+
+func main() {
+	/*
+
+		[1,4,3,2]
+
+	*/
+
+	tests := []struct {
+		name  string
+		input []int
+		want  int
+	}{
+		{
+			name:  "test-[1,4,3,2]",
+			input: []int{1, 4, 3, 2},
+			want:  4,
+		},
+		{
+			name:  "test-[6,2,6,5,1,2]",
+			input: []int{6, 2, 6, 5, 1, 2},
+			want:  9,
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/tags/数组/简单/array-partition-i/golang/main.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return arrayPairSum(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func arrayPairSum(nums []int) int {
+
+}

questions/tags/数组/简单/array-partition-i/golang/solution/array-partition-i.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return arrayPairSum(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func arrayPairSum(nums []int) int {
+
+}