浙大版《C语言程序设计(第4版)》题目集参考答案
本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
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
提交结果:
基本思路:
1.先检查是否存在为空的情况
2.依次对比大小尾插,直到有一个为空,再将所以结点尾插不为空的列表上
代码实现:
1.有哨兵
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2)
{
if (list1 == NULL)//排空
{
return list2;
}
else if (list2 == NULL)
{
return list2;
}
struct ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode));//创建哨兵
struct ListNode* tail = head;
while (list1 && list2)//比较大小尾插
{
if (list1->data < list2->data)
{
tail->next = list1;
tail = list1;
list1 = list1->next;
}
else
{
tail->next = list2;
tail = list2;
list2 = list2->next;
}
}
if (list1)//剩余结点尾插
{
tail->next = list1;
}
else
{
tail->next = list2;
}
struct ListNode* pt = head;//释放哨兵
head = head->next;
free(pt);
return head;
}
2.无哨兵
(1)
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2)
{
if (list1 == NULL)//排空
{
return list2;
}
else if (list2 == NULL)
{
return list2;
}
struct ListNode* head = NULL;
struct ListNode* tail = NULL;
if (list1->data < list2->data)//第一个结点
{
head = list1;
tail = list1;
list1 = list1->next;
}
else
{
head = list2;
tail = list2;
list2 = list2->next;
}
while (list1 && list2)//比较大小尾插
{
if (list1->data < list2->data)
{
tail->next = list1;
tail = list1;
list1 = list1->next;
}
else
{
tail->next = list2;
tail = list2;
list2 = list2->next;
}
}
if (list1)//剩余结点尾插
{
tail->next = list1;
}
else
{
tail->next = list2;
}
return head;
}
(2)
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2)
{
if (list1 == NULL)//排空
{
return list2;
}
else if (list2 == NULL)
{
return list2;
}
struct ListNode* head = NULL;
struct ListNode* tail = NULL;
while (list1 && list2)//比较大小尾插
{
if (list1->data < list2->data)
{
if (head == NULL)//第一个结点
{
head = list1;
tail = list1;
list1 = list1->next;
}
else
{
tail->next = list1;
tail = list1;
list1 = list1->next;
}
}
else
{
if (head == NULL)//第一个结点
{
head = list2;
tail = list2;
list2 = list2->next;
}
else
{
tail->next = list2;
tail = list2;
list2 = list2->next;
}
}
}
if (list1)//剩余结点尾插
{
tail->next = list1;
}
else
{
tail->next = list2;
}
return head;
}