147 accepted. 159ms > 9ms

Author: aQua

Algorithms/0147.insertion-sort-list/README.md

@@ -0,0 +1,8 @@
+# [147. Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)
+
+## 题目
+Sort a linked list using insertion sort.
+
+## 解题思路
+
+见程序注释

Algorithms/0147.insertion-sort-list/insertion-sort-list.go

@@ -0,0 +1,37 @@
+package Problem0147
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Golang/kit"
+)
+
+type ListNode = kit.ListNode
+
+func insertionSortList(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+
+	count := 0
+	temp := &ListNode{Next: head}
+	for temp.Next != nil {
+		count++
+		temp = temp.Next
+	}
+
+	headPre := &ListNode{Next: head}
+
+	for cnt := count - 1; cnt > 0; cnt-- {
+		temp = headPre
+		for c := cnt; c > 0; c-- {
+			if temp.Next.Val > temp.Next.Next.Val {
+				tempNext := temp.Next
+				temp.Next = temp.Next.Next
+				tempNext.Next = temp.Next.Next
+				temp.Next.Next = tempNext
+			}
+			temp = temp.Next
+		}
+	}
+
+	return headPre.Next
+}

Algorithms/0147.insertion-sort-list/insertion-sort-list_test.go

@@ -0,0 +1,47 @@
+package Problem0147
+
+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{2, 4, 3, 1, 5},
+		[]int{1, 2, 3, 4, 5},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_insertionSortList(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+
+		head := kit.Ints2List(tc.head)
+		ast.Equal(tc.ans, kit.List2Ints(insertionSortList(head)), "输入:%v", tc)
+	}
+}
+
+func Benchmark_insertionSortList(b *testing.B) {
+	head := &ListNode{}
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			b.StopTimer()
+			head = kit.Ints2List(tc.head)
+			b.StartTimer()
+			insertionSortList(head)
+		}
+	}
+}