LeetCode Partition List

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.

Solution:

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function

        ListNode *myhead=new ListNode(0);
        myhead->next=head;
        
        ListNode* curr1=myhead,*curr2=myhead;
        while(curr1->next!=NULL&&curr1->next->val<x)
            curr1=curr1->next;
        curr2=curr1->next;
        while(curr1->next){
            while(curr2->next!=NULL&&curr2->next->val>=x)
                curr2=curr2->next;
            if(curr2->next==NULL)
                break;
            ListNode* bak=curr1->next;
            curr1->next=curr2->next;
            curr2->next=curr2->next->next;
            curr1->next->next=bak;
            curr1=curr1->next;
        }
        head=myhead->next;
        delete myhead;
        return head;
    }
};