https://algorithm.liangqin.ren/tags/merge-sort/Recent content in Merge Sort on Algorithm SolutionsHugo -- gohugo.ioSat, 05 Dec 2020 09:02:46 +0000https://algorithm.liangqin.ren/leetcode/23/Sat, 05 Dec 2020 09:02:46 +0000https://algorithm.liangqin.ren/leetcode/23/1. Description 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. 2. Example 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 linked list: 1->1->2->3->4->4->5->6 Example 2 Input: lists = [] Output: [] Example 3 Input: lists = [[]]