首页 > 代码库 > Partition List
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.
/** * 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){ ListNode* leftHead = new ListNode(-1); ListNode* rightHead = new ListNode(-1); ListNode* p1 = leftHead; ListNode* p2 = rightHead; ListNode* p = head; while(p){ if(p->val<x){ p1->next = p; p1 = p; p = p->next; }else{ p2->next = p; p2 = p; p = p->next; } } p1->next = rightHead->next; p2->next = nullptr; return leftHead->next; }};
Partition List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。