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.

解题思路

这是一个双指针问题，一个指针向前扫描，另一个指针保持当前小于target的最后一个。

代码

class Solution {
public:
    ListNode* partition(ListNode* head, int x) {
       if(!head) return head;
        ListNode* dummy=new ListNode(0);
        dummy->next=head;
        ListNode* walker=dummy;
        ListNode* runner=dummy;
        while(runner->next){
            if(runner->next->val<x){
                if(walker!=runner){
                    ListNode* next=runner->next->next;
                    runner->next->next=walker->next;
                    walker->next=runner->next;
                    runner->next=next;
                }
                else
                    runner=runner->next;
                walker=walker->next;
            }
            else runner=runner->next;
        }
        return dummy->next;
    }
};