-
Notifications
You must be signed in to change notification settings - Fork 0
/
086.go
48 lines (40 loc) · 890 Bytes
/
086.go
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
39
40
41
42
43
44
45
46
47
48
package p086
/**
Given a linked list and a value x, partition it such that all nodes less than x
come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.
*/
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
type ListNode struct {
Val int
Next *ListNode
}
func partition(head *ListNode, x int) *ListNode {
master := &ListNode{0, head}
slow, quick := master, master
for quick.Next != nil {
if quick.Next.Val < x {
if slow != quick {
tmp := quick.Next
quick.Next = quick.Next.Next
tmp.Next = slow.Next
slow.Next = tmp
} else {
quick = quick.Next
}
slow = slow.Next
} else {
quick = quick.Next
}
}
return master.Next
}