# 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->null and x = 3,
return 1->2->2->4->3->5->null.

## 链接地址

http://www.lintcode.com/en/problem/partition-list/

## 解法

  ListNode *partition(ListNode *head, int x) {
ListNode *dummyNode1 = new ListNode();
dummyNode1->next = NULL;
ListNode *dummyNode2 = new ListNode();
dummyNode2->next = NULL;
ListNode *cur1 = dummyNode1;
ListNode *cur2 = dummyNode2;
while (cur != NULL) {
if (cur->val < x) {
cur1->next = cur;
cur1 = cur1->next;
}else{
cur2->next = cur;
cur2 = cur2->next;
}
cur = cur->next;
}
cur2->next = NULL;
cur1->next = dummyNode2->next;
return dummyNode1->next;
}
• 本文已收录于以下专栏：

## C++STL隨手筆記(二)List容器的splice及std::partition用法

list容器內建splice這個函數，可以將容器依指定範圍切割， 以及std的partition可以對容器中的元素進行條件篩選並排續， 稱著記憶猶新趕快記錄下來用法。 #include #in...

## leetcode || 86、Partition List

problem： Given a linked list and a value x, partition it such that all nodes less than x come ...

## Leetcode 86. Partition List

Given a linked list and a value x, partition it such that all nodes less than x come before nodes gr...

## Leetcode Partition List

Given a linked list and a value x, partition it such that all nodes less than x come before nodes gr...

## leetcode[86]:Partition List

Partition ListGiven a linked list and a value x, partition it such that all nodes less than x come b...

## Partition List--LeetCode

举报原因： 您举报文章：Partition List 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)