[Leetcode]Merge k Sorted Lists
Merge k sorted
linked lists and return it as one sorted list. Analyze and describe its complexity.
合并k个有序的链表~
brute force的方法是把这k个链表一个一个的合并起来,如 k个链表为[l1, l2, l3, l4],可以先合并l1, l2,再把合并得到的链表与l3合并,最后再与
原创
2015-03-19 08:05:25 ·
293 阅读 ·
0 评论