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 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.

Hide Tags

  Linked List Two Pointers

Have you met this question in a real interview?

思路：分类讨论，依据头结点的数据是否大于x，进行划分

/**
 * 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=NULL;
        ListNode *big=NULL;
        ListNode *pre=NULL;
        ListNode *cur=head;
        if(head==NULL)
            return head;
        if(cur->val<x)
            small=cur;
        else
            big=cur;
        pre=cur;
        cur=cur->next;
        
        if(small!=NULL)
        {
            while(cur!=NULL)
            {
                if(cur->val<x&&big==NULL){
                    small=cur;
                    cur=cur->next;
                }
                else if(cur->val>=x&&big==NULL){
                    big=cur;
                    cur=cur->next;
                }
                else if(cur->val<x&&big!=NULL)
                {
                    ListNode * post=cur->next;
                    cur->next=small->next;
                    small->next=cur;
                    big->next=post;
                    small =cur;
                    cur=post;
                }
                else if(cur->val>=x&&big!=NULL)
                {
                    big=cur;
                    cur=cur->next;
                }
            }
            
            return head;
        }
        else
        {
            while(cur!=NULL)
            {
                if(cur->val<x&&small==NULL)
                {
                    ListNode * post=cur->next;
                    cur->next=head;
                    head=cur;
                    small=cur;
                    big->next=post;
                    cur=post;
                }
                else if(cur->val>=x&&small==NULL)
                {
                    big=cur;
                    cur=cur->next;
                }
                else if(cur->val<x&&small!=NULL)
                {
                    ListNode * post=cur->next;
                    cur->next=small->next;
                    small->next=cur;
                    small=cur;
                    big->next=post;
                    cur=post;
                    
                }
                else if(cur->val>=x&&small!=NULL)
                {
                    big=cur;
                    cur=cur->next;
                }
                
            }
            
            return head;
        }
    }
};

解法2：

参见：https://oj.leetcode.com/discuss/9738/my-accepted-solution-any-improvement

分别维护两个指针，一个指向比x小的链表，另一个指向大于等于x的链表

ListNode *partition(ListNode *head, int x) {
    ListNode *lh = new ListNode (0), *rh = new ListNode (0);
    ListNode *lt = lh, *rt = rh; 
    ListNode *ret = head; 
    while(head)
    {
        if(head->val < x)
            lt = lt->next = head;
        else
            rt = rt->next = head;
        head = head->next;
    }
    lt->next = rh->next;
    rt->next = 0;
    ret = lh->next;
    delete lh;
    delete rh;
    return ret;
}