编写程序以 x 为基准分割链表,使得所有小于 x 的节点排在大于或等于 x 的节点之前。如果链表中包含 x,x 只需出现在小于 x 的元素之后(如下所示)。分割元素 x 只需处于“右半部分”即可,其不需要被置于左右两部分之间。
示例:
输入: head = 3->5->8->5->10->2->1, x = 5
输出: 3->1->2->10->5->5->8
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/partition-list-lcci
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法一:
func partition(head *ListNode, x int) *ListNode {
lHead := &ListNode{0,nil}
rHead := &ListNode{0,nil}
l := lHead
r := rHead
for head != nil {
t := &ListNode{head.Val,nil}
if head.Val < x {
l.Next = t
l = l.Next
} else {
r.Next = t
r = r.Next
}
head = head.Next
}
l.Next = rHead.Next
return lHead.Next
}
方法二:
常数级额外空间:
func partition(head *ListNode, x int) *ListNode {
lHead := &ListNode{0,nil}
rHead := &ListNode{0,nil}
l := lHead
r := rHead
for head != nil {
t := head.Next
if head.Val < x {
l.Next = head
l = l.Next
l.Next = nil
} else {
r.Next = head
r = r.Next
r.Next = nil
}
head = t
}
l.Next = rHead.Next
return lHead.Next
}