D
Size: a a a
D
D
PM
D
D
D
I
PM
D
VS
PM
VS
D
# https://leetcode.com/problems/merge-k-sorted-lists/submissions/
def merge_k_lists(lists)
arr = []
# fill array
lists.each do |x|
while x do
arr.push(x)
x = x.next
end
end
arr.sort_by!{|x| x.val}
return nil if arr.empty?
head = arr[0]
(1...arr.size).each{|i| arr[i-1].next = arr[i]}
arr.last.next = nil
head
end
VS
VS
VS
PM
# https://leetcode.com/problems/merge-k-sorted-lists/submissions/
def merge_k_lists(lists)
arr = []
# fill array
lists.each do |x|
while x do
arr.push(x)
x = x.next
end
end
arr.sort_by!{|x| x.val}
return nil if arr.empty?
head = arr[0]
(1...arr.size).each{|i| arr[i-1].next = arr[i]}
arr.last.next = nil
head
end
SS
SS
SS