Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
1. scan every head of each list, find the minimum value, remove minimum one to the result ListNode
2. divide and conquer. merge every two lists(just as the "Merge two Sorted List" problem) in recursive way
Get help from :
http://blog.unieagle.net/2012/10/05/leetcode%E9%A2%98%E7%9B%AE%EF%BC%9Amerge-k-sorted-lists/