143 added

Author: aQua

Algorithms/0143.reorder-list/README.md

@@ -0,0 +1,14 @@
+# [143. Reorder List](https://leetcode.com/problems/reorder-list/)
+
+## 题目
+Given a singly linked list L: L0->L1->…->Ln-1->Ln,
+
+reorder it to: L0->Ln->L1->Ln-1->L2->Ln-2->…
+
+You must do this in-place without altering the nodes' values.
+
+For example, Given {1,2,3,4}, reorder it to {1,4,2,3}.
+
+## 解题思路
+
+见程序注释

Algorithms/0143.reorder-list/reorder-list.go

@@ -0,0 +1,11 @@
+package Problem0143
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Golang/kit"
+)
+
+type ListNode = kit.ListNode
+func reorderList(head *ListNode)  {
+
+	
+}

Algorithms/0143.reorder-list/reorder-list_test.go

@@ -0,0 +1,46 @@
+package Problem0143
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Golang/kit"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	head []int
+	ans  []int
+}{
+
+	{
+		[]int{1, 2, 3, 4},
+		[]int{1, 4, 2, 3},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_reorderList(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+
+		head := kit.Slice2List(tc.head)
+		reorderList(head)
+		ans := kit.List2Slice(head)
+
+		ast.Equal(tc.ans, ans, "输入:%v", tc)
+	}
+}
+
+func Benchmark_reorderList(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			reorderList(kit.Slice2List(tc.head))
+		}
+	}
+}