题目描述
编写代码,以给定值x为基准将链表分割成两部分,所有小于x的结点排在大于或等于x的结点之前
给定一个链表的头指针 ListNode* pHead,请返回重新排列后的链表的头指针。注意:分割以后保持原来的数据顺序不变。
import java.util.*;
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Partition {
public ListNode partition(ListNode pHead, int x) {
// write code here
if(x == 0) return pHead;
ListNode headp1 = new ListNode(0);
ListNode p1 = headp1;
ListNode headp2 = new ListNode(0);
ListNode p2 = headp2;
ListNode p = pHead;
while(p != null){
if(p.val >= x) {
p1.next = p;
p = p.next;
p1 = p1.next;
p1.next = null;
}
else{
p2.next = p;
p = p.next;
p2 = p2.next;
p2.next = null;
}
}
p2.next = headp1.next;
return headp2.next;
}
}