[刷题]Partition List

最新推荐文章于 2025-07-29 14:24:32 发布

原创最新推荐文章于 2025-07-29 14:24:32 发布 · 314 阅读

0 ·

CC 4.0 BY-SA版权

linked list 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了LintCode中关于链表分区的问题解决方案，包括定义链表节点类、实现链表分区函数并返回分隔后的链表。

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

[LintCode]Partition List

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param head: The first node of linked list.
     * @param x: an integer
     * @return: a ListNode 
     */
    public ListNode partition(ListNode head, int x) {
        // 2015-4-24
        if (head == null) {
            return head;
        }
        // 两个新的链表
        ListNode dummyA = new ListNode(0);
        ListNode nodeA = dummyA;
        ListNode dummyB = new ListNode(0);
        ListNode nodeB = dummyB;
        
        while (head != null) {
            if (head.val < x) {
                nodeA.next = head;
                nodeA = nodeA.next;
            } else {
                nodeB.next = head;
                nodeB = nodeB.next;
            }
            head = head.next;
        }
        nodeA.next = dummyB.next;
        nodeB.next = null;
        return dummyA.next;
    }
}