新建两个list，然后遍历原来的list，不断的填充
func partition(head *ListNode, x int) *ListNode {
beforehead := &ListNode{}
before := beforehead
afterhead := &ListNode{}
after := afterhead
for head != nil {
if head.Val < x {
before.Next = head
before = before.Next
} else {
after.Next = head
after = after.Next
}
head = head.Next
}
after.Next = nil
before.Next = afterhead.Next
return beforehead.Next
}
新建两个list，然后遍历原来的list，不断的填充
86. Partition List https://leetcode.com/problems/partitio...
86. Partition List Given a linked list and a value x, par...
题目86. Partition List Given a linked list and a value x, p...
86. Partition List[https://leetcode-cn.com/problems/parti...
86. 分隔链表[https://leetcode-cn.com/problems/partition-list/...
86. 分隔链表[https://leetcode.cn/problems/partition-list/] 给你...
86.分隔链表[https://leetcode-cn.com/problems/partition-list/s...
有一个地方没有考虑到，就是big的表需要在末尾指向None，否则就会time limit出错代码如下：
题目要求： Given a linked list and a value x, partition it suc...
本文标题：86. Partition List.go
本文链接：https://www.haomeiwen.com/subject/dujpvqtx.html
网友评论