feat: add solutions to lc problem: No.0147

No.0147.Insertion Sort List

Author: taoyq1988

solution/0100-0199/0147.Insertion Sort List/README.md

@@ -181,6 +181,42 @@ var insertionSortList = function (head) {
 };
 ```
 
+#### Go
+
+```go
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func insertionSortList(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+	dummy := &ListNode{head.Val, head}
+	pre, cur := dummy, head
+	for cur != nil {
+		if pre.Val <= cur.Val {
+			pre = cur
+			cur = cur.Next
+			continue
+		}
+		p := dummy
+		for p.Next.Val <= cur.Val {
+			p = p.Next
+		}
+		t := cur.Next
+		cur.Next = p.Next
+		p.Next = cur
+		pre.Next = t
+		cur = t
+	}
+	return dummy.Next
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0147.Insertion Sort List/README_EN.md

@@ -171,6 +171,42 @@ var insertionSortList = function (head) {
 };
 ```
 
+#### Go
+
+```go
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func insertionSortList(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+	dummy := &ListNode{head.Val, head}
+	pre, cur := dummy, head
+	for cur != nil {
+		if pre.Val <= cur.Val {
+			pre = cur
+			cur = cur.Next
+			continue
+		}
+		p := dummy
+		for p.Next.Val <= cur.Val {
+			p = p.Next
+		}
+		t := cur.Next
+		cur.Next = p.Next
+		p.Next = cur
+		pre.Next = t
+		cur = t
+	}
+	return dummy.Next
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0147.Insertion Sort List/Solution.go

@@ -0,0 +1,31 @@
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func insertionSortList(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+	dummy := &ListNode{head.Val, head}
+	pre, cur := dummy, head
+	for cur != nil {
+		if pre.Val <= cur.Val {
+			pre = cur
+			cur = cur.Next
+			continue
+		}
+		p := dummy
+		for p.Next.Val <= cur.Val {
+			p = p.Next
+		}
+		t := cur.Next
+		cur.Next = p.Next
+		p.Next = cur
+		pre.Next = t
+		cur = t
+	}
+	return dummy.Next
+}