---恢复内容开始---
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
if (l1 == NULL && l2 == NULL) return NULL;
struct ListNode *ret = (struct ListNode *)malloc(sizeof(struct ListNode));
struct ListNode *cur = ret;
while(l1 || l2)
{
struct ListNode *tmp = (struct ListNode *)malloc(sizeof(struct ListNode));
if (l1 && l2)
{
if (l1->val > l2->val)
{
tmp->val = l2->val;
l2 = l2->next;
}
else
{
tmp->val = l1->val;
l1 = l1->next;
}
}
else if(l1 == NULL)
{
tmp->val = l2->val;
l2 = l2->next;
}
else
{
tmp->val = l1->val;
l1 = l1->next;
}
cur->next = tmp;
cur = cur->next;
}
return ret->next;
}
解答错误
显示详情 前往Playground调试
输入
[]
[0]
[0]
输出
[0,0]
预期结果
[0]
---恢复内容结束---