Given m sorted linked lists of varying lengths (some possibly empty), merge them into one sorted list. Each list is given as a sorted array; return the merged list as an array. Input: a JSON array of arrays.
Input: JSON array of sorted arrays.
Output: Array — the merged sorted list.
Input: [[1,4],[2],[3,5,6]]
Output: [1,2,3,4,5,6]
Explanation: Variable-size lists merged.Input: [[]]
Output: []
Explanation: Single empty list.Input: [[1]]
Output: [1]
Explanation: Single list.0<=m<=10^4total nodes<=10^5