题目链接:https://leetcode.com/problems/partition-list/
思路,直接用两个节点,一个保存左侧的,一个保存右侧的,
最后合并返回即可。
AC 0ms 100% 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) {
if(head==null||head.next==null)
return head;
ListNode left=new ListNode(0);
ListNode right=new ListNode(0);
ListNode p1=left;
ListNode p2=right;
ListNode p=head;
while(p!=null){
if(p.val<x){
p1.next=new ListNode(p.val);
p1=p1.next;
}else{
p2.next=new ListNode(p.val);
p2=p2.next;
}
p=p.next;
}
p1.next=right.next;
return left.next;
}
}