LeetCode 86. Delimited Linked List

原题网址：https://leetcode.cn/problems/partition-list/submissions/

给一个链表,和一个定值;Requests less than this fixed value to be ranked first and the rest to be ranked together;

用两个链表;A node that holds less than a fixed value,One holds the rest of the linked list;

    public ListNode partition(ListNode head, int x) {
    
        // Use two linked lists to store less than onexone of the values ​​holds the rest

        ListNode lessNode = new ListNode(-1);
        ListNode less = lessNode;
        ListNode moreNode = new ListNode(-1);
        ListNode more = moreNode;

        ListNode cur = head;
        while(cur != null) {
    
            if(cur.val < x) {
    
                ListNode temp = cur;
                less.next = cur;
                less = less.next;
                cur = cur.next;
                temp.next = null;
                
            } else {
    

                ListNode temp = cur;
                more.next = cur;
                more = more.next;
                cur = cur.next;
                temp.next = null;

            }
        }

        less.next = moreNode.next;
        return lessNode.next;

    }