23. Merge k Sorted Lists(連結串列)
阿新 • • 發佈:2019-01-01
題目:https://leetcode.com/problems/merge-k-sorted-lists/
合併n個排序連結串列,直接合並即可。
class Solution { public: ListNode* mergeKLists(vector<ListNode*>& lists) { ListNode * head = new ListNode(0); ListNode * t = head; while(1){ int temp = -1; for(int i = 0; i<lists.size();i++){ if(!lists[i]) continue; if(temp < 0) temp = i; else if(temp>=0 && lists[temp]->val > lists[i]->val) temp = i; } if(temp<0) break; t->next = lists[temp]; t = t->next; lists[temp] = lists[temp]->next; } ListNode *ret = head->next; delete head; return ret; } };