Partition List

来源：互联网发布：淘宝双11红包口令编辑：程序博客网时间：2024/05/16 19:47

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.

/** * 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) {        vector<int> a,b;        ListNode *p,*s,*l;        p=head;        while(p!=NULL){            if(p->val<x){                a.push_back(p->val);                p=p->next;            }            else{                b.push_back(p->val);                p=p->next;            }        }        l=(ListNode*)malloc(sizeof(ListNode));        p=l;        for(int i=0;i<a.size();i++){            s=(ListNode*)malloc(sizeof(ListNode));            s->val=a[i];            p->next=s;            p=s;        }        for(int i=0;i<b.size();i++){            s=(ListNode*)malloc(sizeof(ListNode));            s->val=b[i];            p->next=s;            p=s;        }        p->next=NULL;        l=l->next;        return l;    }};

0 0