[E:82/539, M:76/986, H:10/393] add No: 86: Partition List

Author: gladmo

Diff for: .leetcode.db

@@ -0,0 +1,14 @@
+## [分隔链表](https://leetcode-cn.com/problems/partition-list/)
+
+给你一个链表和一个特定值 __ `x` ，请你对链表进行分隔，使得所有小于 `x` 的节点都出现在大于或等于 `x` 的节点之前。
+
+你应当保留两个分区中每个节点的初始相对位置。
+
+ 
+
+**示例：**
+
+`
+**输入：**head = 1->4->3->2->5->2, _x_ = 3
+**输出：**1->2->2->4->3->5
+`

Diff for: questions/serial/medium/86/README.md

@@ -0,0 +1,55 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/medium/86/golang/solution"
+	"github.com/gladmo/leetcode/utils/list"
+)
+
+func main() {
+
+	tests := []struct {
+		name   string
+		input1 *list.Node
+		input2 int
+		want   string
+	}{
+		{
+			name:   "test-[1,4,3,2,5,2]-3",
+			input1: list.CreateNode("[1,4,3,2,5,2]"),
+			input2: 3,
+			want:   "[1,2,2,4,3,5]",
+		},
+	}
+
+	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.input1, test.input2).String()
+			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)
+	}
+}

Diff for: questions/serial/medium/86/golang/main.go

@@ -0,0 +1,41 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+
+	"github.com/gladmo/leetcode/utils/list"
+)
+
+type ListNode = list.Node
+
+func Export(head *ListNode, x int) *ListNode {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", head, x)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return partition(head, x)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func partition(head *ListNode, x int) *ListNode {
+
+}

Diff for: questions/serial/medium/86/golang/solution/partition-list.go

@@ -0,0 +1,41 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+
+	"github.com/gladmo/leetcode/utils/list"
+)
+
+type ListNode = list.Node
+
+func Export(head *ListNode, x int) *ListNode {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", head, x)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return partition(head, x)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func partition(head *ListNode, x int) *ListNode {
+
+}

Diff for: questions/serial/medium/86/golang/solution/partition-list.go.clean

@@ -0,0 +1,14 @@
+## [分隔链表](https://leetcode-cn.com/problems/partition-list/)
+
+给你一个链表和一个特定值 __ `x` ，请你对链表进行分隔，使得所有小于 `x` 的节点都出现在大于或等于 `x` 的节点之前。
+
+你应当保留两个分区中每个节点的初始相对位置。
+
+ 
+
+**示例：**
+
+`
+**输入：**head = 1->4->3->2->5->2, _x_ = 3
+**输出：**1->2->2->4->3->5
+`

Diff for: questions/tags/双指针/medium/partition-list/README.md

@@ -0,0 +1,63 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/questions/tags/双指针/medium/partition-list/golang/solution"
+	"github.com/gladmo/leetcode/leet"
+)
+
+func main() {
+	/*
+     
+	[1,4,3,2,5,2]
+3
+
+    */
+
+	tests := []struct {
+		name  string
+		input [][]int
+		want  bool
+	}{
+		{
+			name: "test-[[1],[2],[3],[]]",
+			input: [][]int{
+				{1},
+				{2},
+				{3},
+				{},
+			},
+			want: true,
+		},
+	}
+
+	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)
+	}
+}

Diff for: questions/tags/双指针/medium/partition-list/golang/main.go

@@ -0,0 +1,43 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+
+type ListNode struct {
+     Val int
+     Next *ListNode
+}
+
+func Export(head *ListNode, x int) *ListNode {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", head, x)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return partition(head, x)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func partition(head *ListNode, x int) *ListNode {
+
+}

Diff for: questions/tags/双指针/medium/partition-list/golang/solution/partition-list.go

@@ -0,0 +1,43 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+
+type ListNode struct {
+     Val int
+     Next *ListNode
+}
+
+func Export(head *ListNode, x int) *ListNode {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", head, x)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return partition(head, x)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func partition(head *ListNode, x int) *ListNode {
+
+}

Diff for: questions/tags/双指针/medium/partition-list/golang/solution/partition-list.go.clean

@@ -0,0 +1,14 @@
+## [分隔链表](https://leetcode-cn.com/problems/partition-list/)
+
+给你一个链表和一个特定值 __ `x` ，请你对链表进行分隔，使得所有小于 `x` 的节点都出现在大于或等于 `x` 的节点之前。
+
+你应当保留两个分区中每个节点的初始相对位置。
+
+ 
+
+**示例：**
+
+`
+**输入：**head = 1->4->3->2->5->2, _x_ = 3
+**输出：**1->2->2->4->3->5
+`