编写代码,以给定值x为基准将链表分割成两部分,所有小于x的结点排在大于或等于x的结点之前
给定一个链表的头指针 ListNode* pHead,请返回重新排列后的链表的头指针。注意:分割以后保持原来的数据顺序不变。
new关键字之后会创建实例对象,其他的复制都只是引用,比如
new A;//建立A的对象
B=A;//B是A的引用
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Partition {
public ListNode partition(ListNode pHead, int x) {
ListNode right = new ListNode(0);
ListNode left = new ListNode(0);
ListNode left_backup = left;
ListNode right_backup = right;
while(pHead != null){
if(pHead.val < x){
left.next = new ListNode(pHead.val);
left = left.next;
}else{
right.next = new ListNode(pHead.val);
right = right.next;
}
pHead = pHead.next;
}
left.next = right_backup.next;
return left_backup.next;
}
}