将两个非递减的有序链表合并为一个非递增的有序链表代码

可以使用以下代码来实现：ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* result = NULL;
ListNode* temp = NULL;
while(l1 != NULL && l2 != NULL) {
if(l1->val < l2->val) {
if(result == NULL) {
result = l1;
temp = result;
}
else {
temp->next = l1;
temp = temp->next;
}
l1 = l1->next;
}
else {
if(result == NULL) {
result = l2;
temp = result;
}
else {
temp->next = l2;
temp = temp->next;
}
l2 = l2->next;
}
}
if(l1 != NULL) {
temp->next = l1;
}
if(l2 != NULL) {
temp->next = l2;
}
return result;
}