leetcode86. Partition List

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.

Subscribe to see which companies asked this question

package leetcode86;

public class Solution {
	public ListNode partition(ListNode head, int x) {
		if(head==null){
			return head;
		}
		ListNode newHead = new ListNode(-1);
		ListNode newHead2 = new ListNode(-1);
		ListNode r = newHead,r2=newHead2;
		ListNode p = head,q;
		while(p!=null){
			q=p.next;
			if(p.val