Leetcode每日一题 20230815

86. Partition List

题目链接
Given the head of 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.

思路很好想到, 分别用两条链表记录大于小于的情况, 再拼成一条.
Notice: 链表要注意切断
LinkedList result 第一个ListNode head
p.next = head 接的是包括了head之后的所有ListNode

class Solution {
    public ListNode partition(ListNode head, int x) {
        ListNode dummy1 = new ListNode(-1), p1 = dummy1;
        ListNode dummy2 = new ListNode(-1), p2 = dummy2;
        while (head != null){
            if (head.val < x){
                p1.next = head;
                p1= p1.next;
            }
            else{
                p2.next = head;
                p2 = p2.next;
            }
            head = head.next;
        }
        p2.next = null;
        p1.next = dummy2.next;
        return dummy1.next;
    }
}