【链表】Partition List
来源:互联网 发布:机顶盒网络灯红色 编辑:程序博客网 时间:2024/04/29 21:48
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
.
public class Solution { public ListNode partition(ListNode head, int x) { if(head == null) return head; ListNode h1 = new ListNode(0); ListNode h2 = new ListNode(0); ListNode p = head; ListNode p1 = h1; ListNode p2 = h2; while(p != null){ if(p.val < x){ p1.next = p; p1 = p1.next; } else{ p2.next = p; p2 = p2.next; } p = p.next; } p1.next = h2.next; p2.next = null; head = h1.next; h1.next = null; h2.next = null; return head; }}
0 0
- 【链表】Partition List
- leetcode 链表 Partition List
- 链表 Partition List
- leetcode Partition List链表
- leetcode---partition-list---链表
- [leetcode #86 链表]Partition List
- 链表——partition list
- [leetcode] 【链表】86. Partition List
- leetcode_c++:链表:Partition List (086)
- Leetcode86 - Partition List(链表)
- LeetCode 86 Partition List (链表)
- LeetCode-86-Partition List 链表
- Partition List
- Partition List
- Partition List
- Partition List
- Partition List
- Partition List
- hdu 1251 统计难题(字典树)
- 符合本国房交会开幕
- 编程之美初赛第三题
- IE系列
- IEEE802.11 整理
- 【链表】Partition List
- 触发器小例子
- Lua与C++接口对照
- 20.图的存储表示-----------------邻接表
- 使用sizeof计算类的大小
- 背包问题---递归及动态规划
- 栈的应用-进制转换
- linux默认进程最大栈内存8M
- C++对象布局及多态之虚成员函数调用