leetcode -- Partition List
2013-08-05 20:12
357 查看
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
return
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given
1->4->3->2->5->2and x = 3,
return
1->2->2->4->3->5.
相关文章推荐
- LeetCode: Partition List
- [leetcode]Partition List
- leetcode - Partition List
- LeetCode() Partition List
- leetcode:Partition List
- LeetCode:Partition List
- LeetCode--Partition List
- leetcode -- Partition List -- 常见题型重点
- Leetcode: Partition List
- [LeetCode]Partition List
- LeetCode-Partition List
- LeetCode(87)Partition List
- LeetCode:Partition List
- 【LeetCode】Partition List 解题报告
- leetcode之Partition List
- [LeetCode] Partition List
- [leetcode-86]Partition List(c)
- LeetCode | Partition List(partition方法处理链表)
- [Leetcode]Partition List
- leetcode-- Partition List