[LeetCode] Partition List

最新推荐文章于 2019-07-16 09:33:43 发布

原创最新推荐文章于 2019-07-16 09:33:43 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

74 篇文章

订阅专栏

本文详细阐述了如何通过链表实现元素分区，确保所有小于指定值的节点位于前面，大于等于该值的节点位于后面，同时保持相对顺序不变。

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

Partition List:

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal tox.

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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
#define LN ListNode
class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        LN sguard(-1);
	    LN hguard(-1);
	    LN* sTail=&sguard;
	    LN* hTail=&hguard;
	    while(head)
	    {
		    if (head->val<x)
		    {
			    sTail->next=head;
			    sTail=head;
		    }
		    else
		    {
			    hTail->next=head;
			    hTail=head;
		    }
		    head=head->next;
	    }
	    sTail->next=hguard.next;
	    hTail->next=NULL;
	    return sguard.next;
    }
};