首页 > 代码库 > Leetcode: Partition List
Leetcode: 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.
分析：可以将小于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
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。