iven 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; }
* }
*/
public class Solution {
public ListNode partition(ListNode head, int x) {
ListNode dummyMin = new ListNode(0);
ListNode dummyMax = new ListNode(0);
ListNode curMax = dummyMax, curMin = dummyMin;
while(head != null){
if(head.val >=x){
curMax.next = head;
curMax = curMax.next;
}else{
curMin.next = head;
curMin = curMin.next;
}
head = head.next;
}
if(dummyMin.next == null) return dummyMax.next;
curMax.next = null;
curMin.next = dummyMax.next;
return dummyMin.next;
}
}