Leetcode 86. Partition List
Posted zhangwj0101
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode 86. Partition List相关的知识,希望对你有一定的参考价值。
Question
Given 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.
For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.
Code
public ListNode partition(ListNode head, int x)
ListNode min = new ListNode(0);
ListNode max = new ListNode(1);
ListNode minp = min;
ListNode maxp = max;
ListNode p = head;
while (p != null)
if (p.val < x)
minp.next = p;
minp = minp.next;
else
maxp.next = p;
maxp = maxp.next;
p = p.next;
minp.next = max.next;
maxp.next = null;
return min.next;
以上是关于Leetcode 86. Partition List的主要内容,如果未能解决你的问题,请参考以下文章