摘要:
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *mergeKLists(... 阅读全文
posted @ 2013-05-06 23:30
冰点猎手
阅读(142)
评论(0)
推荐(0)