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

/**
 * 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 *list_1 = new ListNode(0); 
		 ListNode *list_2 = new ListNode(0);
		 ListNode *p, *q,*r;
		 r = head; p = list_1; q = list_2;
		 while (r){
			 if (r->val < x) {
				 p->next = r;
				 p = p->next;
			 }
			 else{
				 q->next = r;
				 q = q->next;
			 }
			 r = r->next;
		 }//while
		 p->next = list_2->next;
		 q->next = NULL;
		 return list_1->next; 
    }
};