Leetcode 86. 分隔链表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.
Example:
Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5
 

/**
 * 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*beforedummy=new ListNode(-1);//两个链表都要定义dummy节点
        ListNode*afterdummy=new ListNode(-1);
        ListNode*before=beforedummy;
        ListNode*after=afterdummy;
        while(head!=NULL){
            if(head->val<x){//《
                before->next=head;
                before=before->next;
            }
            else{
                after->next=head;
                after=after->next;//这样after节点就不会为空了
            }
            head=head->next;
        }
        after->next=NULL;
        before->next=afterdummy->next;
        return  beforedummy->next;
        
    }//分隔奇偶链表不设置dummy的原因，两链表的初始头节点都可以找到，如果要保留头节点
    //的话，直接再设置一个指针就好了，而分隔大小值，你并不知道两个头节点在哪，
    //因此只能设置dummy
};