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.

For example,

Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.

Subscribe to see which companies asked this question

原题地址：https://leetcode.com/problems/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* left = new ListNode(0);
        if (NULL == left)
            return head;
        ListNode* leftHead = left;

        ListNode* right = new ListNode(0);
        if (NULL == right)
            return head;
        ListNode* rightHead = right;

        //按值大小分为两个链表
        while (head != NULL)
        {
            if (head->val < x)
            {
                left->next = head;
                left = left->next;
            }
            else
            {
                right->next = head;
                right = right->next;
            }
            head = head->next;
        }
        //左边的连接右边的
        left->next = rightHead->next;
        right->next = NULL;

        return leftHead->next;
    }
};