6-16 链表拼接 (10 分)
本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
struct ListNode {
int data;
struct ListNode *next;
};
函数接口定义:
struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2);
其中list1
和list2
是用户传入的两个按data
升序链接的链表的头指针;函数mergelists
将两个链表合并成一个按data
升序链接的链表,并返回结果链表的头指针。
裁判测试程序样例:
#include <stdio.h> #include <stdlib.h> struct ListNode { int data; struct ListNode *next; }; struct ListNode *createlist(); /*裁判实现,细节不表*/ struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2); void printlist( struct ListNode *head ) { struct ListNode *p = head; while (p) { printf("%d ", p->data); p = p->next; } printf("\n"); } int main() { struct ListNode *list1, *list2; list1 = createlist(); list2 = createlist(); list1 = mergelists(list1, list2); printlist(list1); return 0; } /* 你的代码将被嵌在这里 */
输入样例:
1 3 5 7 -1
2 4 6 -1
输出样例:
1 2 3 4 5 6 7
struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2)
{
struct ListNode *head=NULL,*p;
if(list1==NULL&&list2==NULL)
{
return NULL;
}
while(1)
{
if(list1==NULL&&list2!=NULL)
{
p->next=list2;
break;
}
if(list2==NULL&&list1!=NULL)
{
p->next=list1;
break;
}
if(list1->data<list2->data)
{
if(head==NULL)
{
head=list1;
}
else
{
p->next=list1;
}
p=list1;
list1=list1->next;
}
else
{
if(head==NULL)
{
head=list2;
}
else
{
p->next=list2;
}
p=list2;
list2=list2->next;
}
}
return head;
}
struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2)
{
struct ListNode *head=NULL,*p;
while(1)
{
if(list1==NULL&&list2==NULL)
break;
if(list1!=NULL&&list2==NULL)
{
if(head==NULL)
head=list1;
else
p->next=list1;
break;
}
if(list2!=NULL&&list1==NULL)
{
if(head==NULL)
head=list2;
else
p->next=list2;
break;
}
if(list1->data<list2->data)
{
if(head==NULL)
head=list1;
else
p->next=list1;
p=list1;
list1=list1->next;
}
else // liang ge if dehua bu ke yi
{
if(head==NULL)
head=list2;
else
p->next=list2;
p=list2;
list2=list2->next;
}
}
return head;
}