Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
简单归并操作
struct ListNode *mergeTwoLists(struct ListNode *l1, struct ListNode *l2) {
struct ListNode *p = l1, *q = l2, *result = NULL, *k = NULL;
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
if (p -> val <= q->val) {
result = p;
p = p->next;
} else {
result = q;
q = q->next;
}
k = result;
while (p && q) {
if (p->val <= q->val) {
k->next = p;
p = p->next;
} else {
k->next = q;
q = q->next;
}
k = k->next;
}
while (p) {
k->next = p;
p = p->next;
k = k->next;
}
while (q) {
k->next = q;
q = q->next;
k = k->next;
}
return result;
}- Merge Two Sorted Lists: 合并两个链表
- Merge k Sorted Lists: 合并K个链表
- Merge Sorted Array: 合并两个数组
- Sort List: 归并排序两个链表