LeetCode2.2.3(Partition List)

public static void solution_2_2_3(Node head,int x){
Node h1=null,h2=null,temp=head,p1=null,p2=null;
while(temp!=null){
if(temp.data<x){
if(h1==null){
h1=temp;
p1=temp;
}
else{
p1.next=temp;
p1=temp;
}
}
else{
if(h2==null){
h2=temp;
p2=temp;
}
else{
p2.next=temp;
p2=temp;
}
}
temp=temp.next;
}
p1.next=h2;
p2.next=null;
for(Node r=h1;r!=null;r=r.next){
System.out.print(r.data+" ");
}

}