6-11 链表拼接 (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)
{
    if (list1 == NULL && list2 == NULL) {
        return list1;
    }

    struct ListNode* p1, * p2, * node;
    node = (struct ListNode*)malloc(sizeof(struct ListNode));

    int data[100], i = 0;
    for (p1 = list1; p1; p1 = p1->next) {
        data[i++] = p1->data;
    }
    for (p1 = list2; p1; p1 = p1->next) {
        data[i++] = p1->data;
    }
    for (int k = 0; k < i - 1; k++) {
        for (int j = k + 1; j < i; j++) {
            if (data[k] > data[j]) {
                int temp = data[k];
                data[k] = data[j];
                data[j] = temp;
            }
        }
    }
    data[i] = -1;

    /*释放list1,list2的内存（可以不做）*/
    for (p1 = list1, p2 = list1->next; p2; p1 = p2, p2 = p2->next) {
        free(p1);
    }
    for (p1 = list2, p2 = list2->next; p2; p1 = p2, p2 = p2->next) {
        free(p1);
    }

    /*建立新链表,p1作表头，p2作表尾*/
    p1 = p2 = NULL;
    i = 0;
    node->data = data[0];
    while (node->data != -1) {
        if (!p1) {
            p1 = node;
            p1->next = NULL;
        }
        if (p2) {
            p2->next = node;
        }
        p2 = node;
        p2->next = NULL;
        node = (struct ListNode*)malloc(sizeof(struct ListNode));
        node->data = data[++i];
    }

    return p1;
}

2022/2/3 我又回来了，在学完了数据结构之后才想起来自己写过这种代码（被当时的自己蠢哭），于是我自己重写了一遍全过程的，代码如下（带头结点）：

#include <stdio.h>
#include <stdlib.h>

struct ListNode {
    int data;
    struct ListNode *next;
};

struct ListNode *createlist()
{
	struct ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode)), * tail = head;
	head->next = 0;
	int cnt = 0, num;
	printf("Please enter the number of your data:\n");
	scanf("%d", &num);
	printf("Please enter your data:\n");
	while(cnt++ < num){
		struct ListNode* node = (struct ListNode*)malloc(sizeof(struct ListNode));
		scanf("%d", &node->data);
		tail->next = node;
		tail = node;
		node = (struct ListNode*)malloc(sizeof(struct ListNode));
	}
	tail->next = 0;
	return head;
}
struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2)
{
	struct ListNode* p1 = list1->next, * p2 = list2->next, * p3 = list1;
	while(p1 && p2){
		if(p1->data < p2->data){
			p3->next = p1;
			p3 = p1;
			p1 = p1->next;
		}
		else{
			p3->next = p2;
			p3 = p2;
			p2 = p2->next;
		}
	}
	p3->next = p1 ? p1:p2;
	free(list2);
	return list1;
}
void printlist( struct ListNode *head )
{
     struct ListNode *p = head->next;
     printf("After being merged:\n");
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}

int main()
{
	setbuf(stdout,NULL);
    struct ListNode  *list1, *list2;

    list1 = createlist();
    list2 = createlist();
    list1 = mergelists(list1, list2);
    printlist(list1);

    return 0;
}