题目:
给你一个链表的头节点 head 和一个特定值 x ,请你对链表进行分隔,使得所有 小于 x 的节点都出现在 大于或等于 x 的节点之前。
你应当 保留 两个分区中每个节点的初始相对位置。
示例1:
输入:head = [1,4,3,2,5,2], x = 3
输出:[1,2,2,4,3,5]
示例2:
输入:head = [2,1], x = 2
输出:[1,2]
提示:
链表中节点的数目在范围 [0, 200] 内
-100 <= Node.val <= 100
-200 <= x <= 200
解题代码:
struct ListNode* partition(struct ListNode* head, int x){
if(head == NULL)
return NULL;
struct ListNode* less = malloc(sizeof(struct ListNode));
struct ListNode* lessHead = less;
struct ListNode* more = malloc(sizeof(struct ListNode));
struct ListNode* moreHead = more;
while(head != NULL){
if(head->val < x){
less->next = head;
less = less->next;
}else{
more->next = head;
more = more->next;
}
head = head->next;
}
more->next = NULL;
less->next = moreHead->next;
return lessHead->next;
}