mergeksortedlist

README

My Golang solution for this leetcode question

Merge k Sorted Lists

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.length
• 0 <= k <= 10^4
• 0 <= lists[i].length <= 500
• 10^4 <= lists[i][j] <= 10^4
• lists[i] is sorted in ascending order.
• The sum of lists[i].length won't exceed 10^4.

Documentation

Index

• type ListNode
• type ListNodeHeap
  • func (h ListNodeHeap) Len() int
  • func (h ListNodeHeap) Less(i, j int) bool
  • func (h *ListNodeHeap) Pop() interface{}
  • func (h *ListNodeHeap) Push(x interface{})
  • func (h ListNodeHeap) Swap(i, j int)

Types

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

type ListNodeHeap

type ListNodeHeap []*ListNode

func (ListNodeHeap) Len

func (h ListNodeHeap) Len() int

func (ListNodeHeap) Less

func (h ListNodeHeap) Less(i, j int) bool

func (*ListNodeHeap) Pop

func (h *ListNodeHeap) Pop() interface{}

func (*ListNodeHeap) Push

func (h *ListNodeHeap) Push(x interface{})

func (ListNodeHeap) Swap

func (h ListNodeHeap) Swap(i, j int)