题目:
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
.
解题:
新建两个链表用来存比x小和大于等于x的节点,从头开始遍历原始链表,小于x的节点放在第一个链表,大于等于x的节点放在另外一个链表。
代码:
public class Solution {
public ListNode partition(ListNode head, int x) {
if(head==null||head.next==null)
return head;
ListNode fakeNode1=new ListNode(-1);//存放比x小的
ListNode fakeNode2=new ListNode(-1);//存放大于等于x的
ListNode cur1=fakeNode1,cur2=fakeNode2;
while(head!=null)
{
<strong> ListNode next=head.next;</strong>
if(head.val<x)
{
cur1.next=head;
cur1=cur1.next;
}
else {
cur2.next=head;
cur2=cur2.next;
<strong>cur2.next=null;</strong>
}
head=next;
}
cur1.next=fakeNode2.next;
return fakeNode1.next;
}
}
注重注意我加粗的两行代码