【链表遍历】86. Partition List

遍历链表，把链表元素小于x和不小于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 *less=(ListNode*)malloc(sizeof(ListNode));
        ListNode *greater=(ListNode*)malloc(sizeof(ListNode));
        less->next=NULL;
        greater->next=NULL;
        
        ListNode* temp1=less;
        ListNode* temp2=greater;
        while(head!=NULL)
        {
            if(head->val>=x)
            {
                greater->next=head;
                greater=greater->next;
            }
            else
            {
                less->next=head;
                less=less->next;
            }
            
            head=head->next;
        }
        
        less->next=temp2->next;
        greater->next=NULL;
        
        
        return temp1->next;      
    }
};