462 added

Author: aQua

Algorithms/0462.minimum-moves-to-equal-array-elements-ii/README.md

@@ -0,0 +1,26 @@
+# [462. Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)
+
+## 题目
+
+Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.
+
+You may assume the array's length is at most 10,000.
+
+Example:
+
+```text
+Input:
+[1,2,3]
+
+Output:
+2
+
+Explanation:
+Only two moves are needed (remember each move increments or decrements one element):
+
+[1,2,3]  =>  [2,2,3]  =>  [2,2,2]
+```
+
+## 解题思路
+
+见程序注释

Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii.go

@@ -0,0 +1,7 @@
+package Problem0462
+
+func minMoves2(nums []int) int {
+	res := 2
+
+	return res
+}

Algorithms/0462.minimum-moves-to-equal-array-elements-ii/minimum-moves-to-equal-array-elements-ii_test.go

@@ -0,0 +1,39 @@
+package Problem0462
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	nums []int
+	ans  int
+}{
+
+	{
+		[]int{1, 2, 3},
+		2,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_minMoves2(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, minMoves2(tc.nums), "输入:%v", tc)
+	}
+}
+
+func Benchmark_minMoves2(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			minMoves2(tc.nums)
+		}
+	}
+}