1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

// @Title: 分隔链表 (Partition List)
// @Author: 15816537946@163.com
// @Date: 2021-01-03 17:10:03
// @Runtime: 0 ms
// @Memory: 2.4 MB
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */

// 模拟
func partition(head *ListNode, x int) *ListNode {
	small := new(ListNode)
	smallHead := small // 链表哑节点
	large := new(ListNode)
	largeHead := large // 链表哑节点

	// 重建 small 和 large
	for head != nil {
		if head.Val < x {
			small.Next = head
			small = small.Next
		} else {
			large.Next = head
			large = large.Next
		}
		head = head.Next
	}

	large.Next = nil
	small.Next = largeHead.Next
	return smallHead.Next

}