首页 > 代码库 > LeetCode--Merge k Sorted Lists
LeetCode--Merge k Sorted Lists
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(vector<ListNode *> &lists) { int n = lists.size(); if(n == 0 ) return NULL; if(n == 1) return lists[0]; while(n!=1) { vector<ListNode*> list_temp; for(int i=0; i<n; i=i+2) { int end = i+1; if(i+1>=n) end = n-1; if(end == i) { list_temp.push_back(lists[i]); break; } ListNode* temp = mergeTwoLists(lists[i],lists[end]); list_temp.push_back(temp); } lists = list_temp; n = lists.size(); } return lists[0]; } ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { if(l1 == NULL) return l2; if(l2 == NULL) return l1; ListNode* head; ListNode* temp; if(l1->val < l2->val) { head = l1; temp = l2; } else { head = l2; temp = l1; } ListNode* temp1 = head->next; ListNode* now = head; while(temp1!=NULL && temp!=NULL) { if(temp1->val > temp->val) { now->next = temp; now = now->next; temp = temp->next; } else { now->next = temp1; now = now->next; temp1 = temp1->next; } } if(temp1 == NULL) now->next = temp; if(temp == NULL) now->next = temp1; return head; } };
LeetCode--Merge k Sorted Lists
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。