int main(void)
{
node_t *a = create_sorted_list(3200);
node_t *b = create_sorted_list(1600);
print_list(a);
print_list(b);
node_t *c = merge_sorted_list(a, b);
print_list(c);
free_list(c);
/* No need to free a/b, already merged in c */
return 0;
}
int main() {
std::vector<int> l1 = {1,3,5,7,9};
std::vector<int> l2 = {2,4,6,8,10};
std::vector<int> l3 = {12,13,14,15,16};
ListNode *pL1 = create_sorted_list(l1);
ListNode *pL2 = create_sorted_list(l2);
ListNode *pL3 = create_sorted_list(l3);
// std::vector<ListNode*> sorted_lists = {pL1, pL2, pL3};
std::vector<ListNode*> sorted_lists = {pL1, nullptr};
Solution soln;
ListNode *pNewHead = soln.mergeKLists(sorted_lists);
print_list(pNewHead);
}
int main(){
struct Node * m = create_sorted_list(5,1000);
struct Node * n = create_sorted_list(5,100);
printf("\nList m:\n"); print_list(m);
printf("\n");
printf("\nList n:\n"); print_list(n);
printf("\n");
printf("\nDeze worden gemerged. \n\n");
printf("\n");
struct Node * mn = merge(&m,&n);
printf("\nList m:\n"); print_list(m);
printf("\n");
printf("\nList n:\n"); print_list(n);
printf("\n");
printf("\nList mn:\n"); print_list(mn);
printf("\n");
}
int main()
{
struct Node * list = create_sorted_list(7,8);
printf("Before reverse:\n");
print(print_list, list);
printf("\nAfter reverse:\n");
reverse(&list);
print(print_list, list);
printf("\n");
}
