Explore diverse LeetCode solutions in Python, C++, JavaScript, SQL, and TypeScript. Ideal for interview prep, learning, and code practice in multiple programming languages. Github Repo Link
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Merge all the linked-lists into one sorted linked-list and return it.
Example 1:
Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4-> 4->5->6
Example 2:
Input: lists = [] Output: []
Example 3:
Input: lists = [[]] Output: []
Constraints:
k == lists.length0 <= k <= 10 40 <= lists[i].length <= 500-10 4 <= lists[i][j] <= 10 4lists[i]is sorted in ascending order.- The sum of
lists[i].lengthwill not exceed10 4.
Python
# Definition for singly-linked list. from typing import List, Optional class ListNode: def __init__(self, val=0, next=None): self.val = val self.next = next class Solution: def mergeKLists(self, lists : List[Optional[ListNode]]) -> Optional[ListNode]: nodes = [] head = point = ListNode(0) for left in lists: while left: nodes.append(left.val) left = left.next for x in sorted(nodes): point.next = ListNode(x) point = point.next return head.next
![[Leetcode] 0253. Meeting Rooms II](https://hogantechs.com/wp-content/uploads/2024/12/4-1024x577.png)
简体中文 
繁體中文 
English 
한국어 
日本語 
Español