原文链接
题目描述
题目链接
解题思路
package com.kami.leetcode.list_study;
import com.kami.leetcode.list_study.listNode.ListNode;
public class Solution_86 {
public ListNode partition(ListNode head, int x){
if(head == null || head.next == null){
return head;
}
ListNode smallHead = new ListNode(0);
ListNode l1 = smallHead;
ListNode bigHead = new ListNode(0);
ListNode l2 = bigHead;
ListNode cur = head;
while (cur != null){
if(cur.val < x){
l1.next = cur;
l1 = l1.next;
}else {
l2.next = cur;
l2 = l2.next;
}
cur = cur.next;
}
l1.next = bigHead.next;
l2.next = null;
return smallHead.next;
}
}