leetcode 86. 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.

建立两个分别小于和大于等于给定值的链表，之后把后面的连到前面的最后

public class Solution {
    public ListNode partition(ListNode head, int x) {
        ListNode lesshead = new ListNode(0);
        ListNode greaterhead = new ListNode(0);
        ListNode less = lesshead;
        ListNode greater = greaterhead;
        while(head!=null){
            if(head.val<x){
                less.next = head;
                less = less.next;
            }else{
                greater.next = head;
                greater = greater.next;
            }
            head = head.next;
        }
        less.next = greaterhead.next;
        greater.next = null;
        return lesshead.next;
    }
}