本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
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
题目集全集传送门
思路来源:https://blog.csdn.net/qq_43788669/article/details/88360508
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2)
{
struct ListNode* head = NULL, * tail = NULL, * p1 = NULL, * p2 = NULL;
int a[100], index = 0, temp;
for (p1 = list1; p1 != NULL; p1 = p1->next)
a[index++] = p1->data;
for (p1 = list2; p1 != NULL; p1 = p1->next)
a[index++] = p1->data;
for(int i=0;i<index;i++) //排序
for (int j = i; j < index; j++)
if (a[i] > a[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
for (int i = 0; i < index; i++)
{
p2 = (struct ListNode*)malloc(sizeof(struct ListNode));
p2->data = a[i];
p2->next = NULL;
if (head == NULL)
head = p2;
else
tail->next = p2;
tail = p2;
}
return head;
}