题目:
6-6 链表拼接 (20 分)
本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
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 *p = list1;
int v[10000], n = 0;
while(p != NULL)
{
v[n++] = p->data;
p = p->next;
}
p = list2;
while(p != NULL)
{
v[n++] = p->data;
p = p->next;
}
int i, j;
for(i = 0; i < n - 1; i++)
for(j = 0; j < n - 1 - i; j++)
if(v[j] > v[j + 1])
{
int temp = v[j];
v[j] = v[j + 1];
v[j + 1] = temp;
}
struct ListNode* pre, *q, *head = NULL;
int flag = 0;
for(i = 0; i < n; i++)
{
q = (struct ListNode *)malloc(sizeof(struct ListNode));
q->data = v[i];
q->next = NULL;
if(!flag) flag = 1, head = q;
else p->next = q;
p = q;
}
return head;
}