Node *MergeTwoList(Node *head1, Node *head2) {
Node *i = head1->next;
Node *j = head2->next;
Node *nhead = new Node(-1);
Node *k = nhead;
while(i != nullptr && j != nullptr) {
if(i->val <= j->val) {
k->next = i;
i = i->next;
k = k->next;
} else if(i->val > j->val) {
k->next = j;
j = j->next;
k = k->next;
}
}
if(i != nullptr) {
k->next = i;
} else {
k->next = j;
}
return nhead;
}