码迷,mamicode.com
首页 > 其他好文 > 详细

Partition List

时间:2014-06-03 14:12:24      阅读:306      评论:0      收藏:0      [点我收藏+]

标签:des   c   style   class   blog   code   

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.

bubuko.com,布布扣
/**
 * 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) 
    {
        if(head==NULL || head->next==NULL) return head;
        
        ListNode* pLarge;
        ListNode* pSmall;
        ListNode* pMid;
        
        if(head->val<x) pSmall=head;
        else
        {
            pLarge=head;
            pMid=head;
            while(pMid->next!=NULL && pMid->next->val>=x) pMid=pMid->next;
            if(pMid->next==NULL) return head;
            head=pMid->next;
            pMid->next=head->next;
            head->next=pLarge;
            pSmall=head;
        }
        
        while(true)
        {
            pMid=pSmall;
            
            while(pMid->next!=NULL && pMid->next->val>=x) pMid=pMid->next;
            if(pMid->next==NULL) break;
            
            pLarge=pMid->next;
            pMid->next=pLarge->next;
            pLarge->next=pSmall->next;
            pSmall->next=pLarge;
            
            while(pSmall->next!=NULL && pSmall->next->val<x) pSmall=pSmall->next;
            if(pSmall->next==NULL) break;
        }
        return head;
    }
}; 
bubuko.com,布布扣

Partition List,布布扣,bubuko.com

Partition List

标签:des   c   style   class   blog   code   

原文地址:http://www.cnblogs.com/erictanghu/p/3759540.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!