本文共 897 字，大约阅读时间需要 2 分钟。
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. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public ListNode partition(ListNode head, int x) { ListNode cur=head; ListNode smaller_sentinel=new ListNode(0); ListNode smaller_cur=smaller_sentinel; ListNode larger_sentinel=new ListNode(0); ListNode larger_cur=larger_sentinel;//Now, go along the list, partitioning into two halves. while(cur!=null){ if(cur.val 转载地址：http://mnuni.baihongyu.com/