请教一个关于链表的问题

[NaVient]

假如我现在有两个链表 A, B
A 链表: 1 -> 3 -> 5
B 链表： 2 -> 4 -> 6

最终合并结果是 链表: 1 -> 2 -> 3 -> 4 -> 5 -> 6 该如何做？

[frandy]

a = [1,3,5]
b = [2,4,6]
c = a+b
c.sort()
print(c)

[meik2333]

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if (l1 == nullptr) {
return l2;
} else if (l2 == nullptr) {
return l1;
}
auto *head = new ListNode(0);
auto *cur = head;
while (l1 and l2) {
if (l1->val < l2->val) {
cur->next = l1;
l1 = l1->next;
} else {
cur->next = l2;
l2 = l2->next;
}
cur = cur->next;
}
cur->next = l1 ? l1 : l2;
cur = head->next;
delete head;
return cur;
}

[cjw1115]

@frandy 这操作还是很皮的

[ihainan]

https://leetcode.com/problems/merge-two-sorted-lists/description/ 链表常规题了

[dbw9580]

list(itertools.chain.from_iterable(zip(a,b)))

[zyp0921]

比大小呗- -

[anonymous256]

c = [*a, *b]
c.sort()
print(c)

[seven2016]

链表常规题--归并


[someonedeng]

作业要自己做。

[stargazer]

合并有序链表，，，

[tt67wq]

归并排序似乎就是这个

[Cukuyo]

作业要自己做