本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下:
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* curNode1 = list1;
struct ListNode* curNode2 = list2;
struct ListNode* curNode;
struct ListNode* newList = (struct ListNode*)malloc(sizeof(struct ListNode));
newList->next = NULL;
struct ListNode* temp = newList;
while (curNode1 && curNode2) {
struct ListNode* newNode = (struct ListNode*)malloc(sizeof(struct ListNode));
if (curNode2->data < curNode1->data) {
newNode->data = curNode2->data;
curNode2 = curNode2->next;
}
else {
newNode->data = curNode1->data;
curNode1 = curNode1->next;
}
temp->next = newNode;
temp = newNode;
}
if (curNode1) {
temp->next = curNode1;
}
if (curNode2) {
temp->next = curNode2;
}
return newList->next;
}
注意点:
这道题不难,提交不通过的原因是,本题的头结点是有数据的!!
我们写的函数返回的是头指针,再看输出函数:
void printlist( struct ListNode *head )
{
struct ListNode *p = head;
while (p) {
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
直接输出了头结点的data,所以,如果我们在mergelists函数中返回链表,就要返回第一个数据结点。如果返回的链表有头结点,所以就要返回头结点的下一个结点。
return newList->next;
最后附上我写的本道题的输入函数:
struct ListNode* createlist() {
struct ListNode* newList = (struct ListNode*)malloc(sizeof(struct ListNode));
newList->next = NULL;
struct ListNode* curNode = newList;
int n;
scanf("%d", &n);
while (n != -1) {
struct ListNode* newNode = (struct ListNode*)malloc(sizeof(struct ListNode));
newNode->data = n;
newNode->next = NULL;
curNode->next = newNode;
curNode = curNode->next;
scanf("%d", &n);
}
return newList;
}
如果测试用例出现这种情况:
那么就要看这里是不是写成了这样:
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2) {
struct ListNode* curNode1 = list1->next;
struct ListNode* curNode2 = list2->next;
应该是这样:
struct ListNode* mergelists(struct ListNode* list1, struct ListNode* list2) {
struct ListNode* curNode1 = list1;
struct ListNode* curNode2 = list2;