From be727d5654a3a508b75b27a77e8f039be7b2e86e Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Fri, 13 Jan 2023 20:55:34 -0500 Subject: [PATCH] Create README - LeetHub --- 23-merge-k-sorted-lists/README.md | 43 +++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 23-merge-k-sorted-lists/README.md diff --git a/23-merge-k-sorted-lists/README.md b/23-merge-k-sorted-lists/README.md new file mode 100644 index 0000000..1f0df1f --- /dev/null +++ b/23-merge-k-sorted-lists/README.md @@ -0,0 +1,43 @@ +

23. Merge k Sorted Lists

Hard

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:

+ + +
\ No newline at end of file