《leetCode-php》合并k个排序链表

最新推荐文章于 2022-07-25 18:35:16 发布

less_cold

最新推荐文章于 2022-07-25 18:35:16 发布

阅读量269

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/less_cold/article/details/103524943

leetCode-php 专栏收录该内容

96 篇文章

订阅专栏

本文介绍了一种使用分治法合并多个已排序链表的方法。通过将链表两两合并，逐步减少链表数量直至只剩下一个链表，实现高效地合并操作。文章提供了完整的PHP代码实现。

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

合并k个排序链表

采用分治法

<?php
class Node {
    public $next = null;
    public $val;
    public function __construct($val) {
        $this->val = $val;
    }
}
function mergeKLists($arrList) {
    $num = count($arrList);
    while ($num > 1) {
        $mid = intval(($num + 1) / 2);
        $arr = [];
        for ($i = 0; $i < $mid; $i ++) {
            $arr[] = mergeTwoLists($arrList[$i], $arrList[$i + $mid]);
        }
        $arrList = $arr;
        $num = count($arrList);
    }
    return $arrList[0];
}
function mergeTwoLists($node1, $node2) {
    $head = new Node(0);
    $p = $head;
    while ($node1 != null && $node2 != null) {
        if ($node1->val > $node2->val) {
            $p->next = $node2;
            $p = $node2;
            $node2 = $node2->next;
        } else {
            $p->next = $node1;
            $p = $node1;
            $node1 = $node1->next;
        }
    }
    if ($node1 != null) {
        $p->next = $node1;
    }
    if ($node2 != null) {
        $p->next = $node2;
    }
    return $head->next;
}
$node1 = new Node(1);
$node2 = new Node(4);
$node3 = new Node(5);
$node1->next = $node2;
$node2->next = $node3;
$node4 = new Node(1);
$node5 = new Node(3);
$node6 = new Node(4);
$node4->next = $node5;
$node5->next = $node6;
$node7 = new Node(2);
$node8 = new Node(6);
$node7->next = $node8;
$arr = [$node1,$node4,$node7];
$head = mergeKLists($arr);
while ($head != null) {
    print $head->val . "\n";
    $head = $head->next;
}