I am trying to use heap to solve the problem "merge K lists" which is merging k sorted linked lists and return it as one sorted list. Generally I create a min heap to store all of the list node and use predefined function LessThanLinkedList() for the compare. But I found pop_heap() operations in line 62 and 75 never work. It will not remove the top of the heap, though I used the predefined compare function as a parameter. The following is my code. I am using visual studio 2010 as IDE. Anyone knows the reason? Thanks a lot for your help!
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
using namespace std;
class Solution {
public:
static bool LessThanLinkedList( const ListNode * l1, const ListNode * l2)
{
return( l1->val > l2->val );
}
ListNode *mergeKLists(vector<ListNode *> &lists) {
int idx;
bool ball_list_null;
ListNode * pNode;
ListNode *new_head;
ball_list_null = true;
for( idx = 0; idx < lists.size(); idx++ )
{
if( NULL != lists[idx] )
{
ball_list_null = false;
break;
}
}
if( true == ball_list_null )
return(NULL);
vector< ListNode* > list_heap;
for( idx = 0; idx < lists.size(); idx++ )
{
if( NULL != lists[idx] )
{
pNode = lists[idx];
while( NULL != pNode )
{
list_heap.push_back( pNode );
pNode = pNode->next;
}
}
}
make_heap( list_heap.begin(), list_heap.end(), LessThanLinkedList );
if(list_heap.size() > 0)
{
new_head = list_heap[0];
pop_heap( list_heap.begin(), list_heap.end(), LessThanLinkedList );//not work
}
if( list_heap.size() == 0 )
{
new_head->next = NULL;
}
else
{
pNode = new_head;
while( list_heap.size() >0 )
{
pNode->next = list_heap[0];
pop_heap( list_heap.begin(), list_heap.end(), LessThanLinkedList ); // not work
pNode = pNode->next ;
}
pNode->next = NULL;
}
return( new_head );
}
};
void main()
{
Solution xpfsln;
ListNode *l1,*l2,*l3,*l4,*l5,*l6,*l7,*head;
l1 = new ListNode(1);
l2 = new ListNode(2);
l3 = new ListNode(3);
l1->next = l2;
l2->next = l3;
l3->next = NULL;
vector<ListNode *> list_vec;
list_vec.push_back(l1);
head = xpfsln.mergeKLists( list_vec );
}
pop_heap
does not remove elements from the container. It can't, since it doesn't even have access to the container, just its elements. What it does (assuming of course that [begin, end)
forms a valid, non-empty heap) is rearrange the elements such that the first element of the heap moves to be the last element of the range, and leaves [begin, end-1)
as a valid heap. If you want to actually remove the element from the container, you just have to erase the last element of the container (e.g. with a call to pop_back()
) after you call pop_heap
.
pop_heap( list_heap.begin(), list_heap.end(), LessThanLinkedList );
list_heap.pop_back();
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With