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

算法实现：

整体思路比较简单，新建两个链表结点，一个链接比x小的节点，另外一个链接比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 *p = new ListNode(0);
        ListNode *ph = new ListNode(0);
        ph -> next = head;
        ListNode *p1 = head, *p2 = p, *p3 = ph;
        while(p1 != NULL){
            if(p1 -> val < x){
                p2 -> next = p1;
                p2 = p2 -> next;
                if(p1 -> next == NULL){
                    p3 -> next = NULL;
                    break;
                }
                else{
                    p3 -> next = p1 -> next;
                    p1 = p1 -> next;
                }                
            }
            else{
                if(p1 -> next == NULL)break;
                p3 = p3 -> next;
                p1 = p1 -> next;
            }            
        }
        p2 -> next = ph -> next;
        return p -> next;
        
    }
};