开始刷leetcode day15：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.

Java:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode partition(ListNode head, int x) {
        if(head == null) return null;
        ListNode l1 = new ListNode(0);
        ListNode l2 = new ListNode(0);
        ListNode l3 = l1;
        ListNode l4 = l2;
        
        
        while(head != null)
        {
            if(head.val>= x)
             {   
                 l2.next = head;
                 head = head.next;
                 l2 = l2.next;
                 l2.next = null;
             }else{
                 l1.next = head;
                 head = head.next;
                 l1 = l1.next;
                 l1.next = null;
             }
             
        }
        
        l1.next = l4.next;
        return l3.next;
    }
}