[LeetCode刷题记录]Partition List-优快云博客

本文链接：https://blog.youkuaiyun.com/CiaoLiang/article/details/44939521

本文介绍了一种链表分区算法，该算法将链表中小于给定值x的节点置于大于等于x的节点之前，同时保持相对顺序不变。通过创建两个辅助链表分别收集小于x和大于等于x的节点，最后连接这两个链表并返回结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

思路：用两个ListNode一个来链接原来List中比x小的，一个用来链接原来List中比x大的。最后把两个List链接起来，删掉多余节点。

空间O(1)时间O(n)。

class Solution {
public:
	ListNode *partition(ListNode *head, int x) {
		if(!head || !head->next) return head;
		ListNode *big = new ListNode(1);
		ListNode *small = new ListNode(-1);
		ListNode *b = big;
		ListNode *s = small;
		ListNode *p = head;
		while (head)
		{
			ListNode *pnext = head->next;
			if(head->val >= x){
				head->next = NULL;
				b->next = head;
				b = head;
			}
			else{
				head->next = NULL;
				s->next = head;
				s = head;
			}
			head = pnext;
		}
		s->next = big->next;
		head = small->next;
		delete small;
		delete big;
		return head;
	}
};

如果想保留原来List的话：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        ListNode *small = new ListNode(0);
        ListNode *large = new ListNode(0);
        ListNode *pre = head;
        ListNode *ret = small;
        ListNode *temp = large;
        if(head==NULL)
            return NULL;
        while(pre!=NULL){
            if(pre->val<x){
                small->next = new ListNode(pre->val);
                small = small->next;
            }
            else{
                large->next = new ListNode(pre->val);
                large = large->next;
            }
            pre=pre->next;
        }
        small->next = temp->next;
        delete temp;
        return ret->next;
    }
};