分割链表（面试）

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode partition(ListNode head, int x) {
        //思路准备分区链表
        ListNode less = new ListNode(0);
        ListNode lessYummy = less;
        ListNode more = new ListNode(0);
        ListNode moreYummy = more;
        ListNode ans = less;
       
        while(head != null){
            if(head.val < x ){
                less.next = new ListNode(head.val);
                less= less.next;
            }else{
                more.next = new ListNode(head.val);
                more = more.next;
            }
            head = head.next;
        }

        //两个链表链接
        while(lessYummy.next!= null){
            lessYummy = lessYummy.next;
        }
        lessYummy.next = moreYummy.next;
        return ans.next;
    }
}