给你一个链表的头节点 head 和一个特定值 x ,请你对链表进行分隔,使得所有 小于 x 的节点都出现在 大于或等于 x 的节点之前。
你应当保留两个分区中每个节点的初始相对位置。
(力扣第86题)
输入:head = [1,4,3,2,5,2], x = 3 输出:[1,2,2,4,3,5] 链表中节点的数目在范围 [0, 200]内
-100 <= Node.val <= 100
-200 <= x <= 200
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} x
* @return {ListNode}
*/
var partition = function(head, x) {
//思路:小的串一串,大的串一串,之后两个串起来
let small = new ListNode(0)
let smallHead = small
let large = new ListNode(0)
let largeHead = large
while(head!==null){
if(head.val<x){
small.next = head
small = small.next
}else{
large.next = head
large = large.next
}
head = head.next
}
large.next = null
small.next = largeHead.next
return smallHead.next
};