首页 > 代码库 > [leetcode] Partition List
[leetcode] Partition List
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.
https://oj.leetcode.com/problems/partition-list/
思路：新建两个链表头，然后遍历原链表根据大小分别添加到新链表头后边，最后合并两个新链表。
public class Solution { public ListNode partition(ListNode head, int x) { if (head == null) return head; ListNode head1 = new ListNode(-1); ListNode head2 = new ListNode(-1); ListNode p = head; ListNode p1 = head1; ListNode p2 = head2; while (p != null) { if (p.val < x) { p1.next = p; p1 = p1.next; } else { p2.next = p; p2 = p2.next; } p = p.next; } p1.next = head2.next; p2.next = null; return head1.next; } public static void main(String[] args) { ListNode head = ListUtils.makeList(new int[] { 1, 4, 3, 2, 5, 2 }); ListUtils.printList(head); new Solution().partition(head, 3); ListUtils.printList(head); }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。