86. Partition List

最新推荐文章于 2024-12-04 16:15:43 发布

Maggie_2015

最新推荐文章于 2024-12-04 16:15:43 发布

阅读量206

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Maggie_2015/article/details/50583569

本文介绍了一种链表分隔算法，该算法将链表中小于给定值x的节点放置在大于或等于x的节点之前，同时保持原始相对顺序不变。通过创建两个虚拟头结点分别用于收集小于x和大于等于x的节点，并最终将这两部分连接起来。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

把数组分成两部分，然后连接在一起

public ListNode partition(ListNode head, int x) {
       if(head == null || head.next == null) return head;
       ListNode big = new ListNode(0),rbig = big;  //大于等于x的部分
       ListNode small = new ListNode(0),rsmall = small; //小于x的部分
       ListNode cur = head;
       while(cur != null){
           if(cur.val < x){
               small.next = cur;
               small = small.next;
           }
           else{
               big.next = cur;
               big = big.next;
           }
           cur = cur.next;
       }
       small.next = rbig.next;  //两部分连接
       big.next = null;
       return rsmall.next;
    }