LeetCode 面试题02.04 分割链表(JAVA)

/**
 * 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 curr = head;
        ListNode pre = head;
        while( curr != null) {
            if(curr.val < x) {
                int temp = curr.val;
                curr.val = pre.val;
                pre.val = temp;
                pre = pre.next;
            }
            curr = curr.next;
        }
        return head;
        
    }
}