LeetCode 86 分割链表 题解
给你一个链表和一个特定值 x ,请你对链表进行分隔,使得所有小于 x 的节点都出现在大于或等于 x 的节点之前。
你应当保留两个分区中每个节点的初始相对位置。
示例:
输入:head = 1->4->3->2->5->2, x = 3
输出:1->2->2->4->3->5
思路:分成两半做
我的代码
class Solution {
public ListNode partition(ListNode head, int x) {
if(head == null || head.next == null){
return head;
}
//分成两半去考虑
ListNode less = new ListNode(-1);
ListNode more = new ListNode(-2);
ListNode lessHead = null;
ListNode moreHead = null;
while(head != null){
if(head.val < x){
if(lessHead == null){
lessHead = head;
}
less.next = head;
less = less.next;
}else{
if(moreHead == null){
moreHead = head;
}
more.next = head;
more = more.next;
}
head = head.next;
}
if(moreHead != null){
less.next = moreHead;
//这里一定要断开。不然会形成环
more.next = null;
}
return lessHead != null ? lessHead:moreHead;
}
}
官方题解
class Solution {
public ListNode partition(ListNode head, int x) {
ListNode small = new ListNode(0);
//这里处理的很好
ListNode smallHead = small;
ListNode large = new ListNode(0);
ListNode largeHead = large;
while (head != null) {
if (head.val < x) {
small.next = head;
small = small.next;
} else {
large.next = head;
large = large.next;
}
head = head.next;
}
large.next = null;
small.next = largeHead.next;
return smallHead.next;
}
}