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

Leetcode: Partition List

时间:2014-11-19 20:32:41      阅读:129      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   io   ar   color   sp   for   on   

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.

分析:可以将小于x的node放在一个链表中,大于等于x的node放在另一个链表中,然后将两个链表首尾相连。

class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        if(head == NULL) return head;
        
        ListNode *shead = new ListNode(-1);
        ListNode *bhead = new ListNode(-1);
        
        ListNode *ps = shead, *pb = bhead;
        while(head){
            ListNode *tmp = head;
            head = head->next;
            tmp->next = NULL;
            if(tmp->val < x){
                ps->next = tmp;
                ps = ps->next;
            }else{
                pb->next = tmp;
                pb = pb->next;
            }
        }
        ps->next = bhead->next;
        
        return shead->next;
    }
};

 

Leetcode: Partition List

标签:des   style   blog   io   ar   color   sp   for   on   

原文地址:http://www.cnblogs.com/Kai-Xing/p/4109027.html

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