LeetCode 86. Partition List

class Solution {
public:
    ListNode* partition(ListNode* head, int x) {
        ListNode* less = new ListNode(0), * greater = new ListNode(0);
        ListNode* lessH = less, * greaterH = greater;
        while(head){
            if(head->val < x){
                less->next = head;
                less = less->next;
            }
            else{
                greater->next = head;
                greater = greater->next;
            }
            head = head->next;
        }
        less->next = greaterH->next;
        greater->next = NULL;
        return lessH->next;
    }
};