PTA linked list 6-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 

正确代码

struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2)
{
    struct ListNode *r,*head,*pre;
    r=NULL;
    head=NULL;
    pre=NULL;
    /*判断list1和list2为头指针的链表是否为空*/
    if(list1==NULL&&list2==NULL)
    {
        return NULL;
    }else if(list1==NULL){
        return list2;
    }else if(list2==NULL){
        return list1;
    }
    
    r=(struct ListNode *)malloc(sizeof(struct ListNode));
    if(list1->data>list2->data)
    {
        r->data=list2->data;
        r->next=NULL;
        head=r;
        list2=list2->next;
    }else{
        r->data=list1->data;
        r->next=NULL;
        head=r;
        list1=list1->next;
    }
    while(list1!=NULL||list2!=NULL)
    {
        pre=(struct ListNode *)malloc(sizeof(struct ListNode));
        if(list1==NULL)
        {
            pre->data=list2->data;
            pre->next=NULL;
            r->next=pre;
            r=r->next;
            list2=list2->next;
            continue;
        }else if(list2==NULL){
            pre->data=list1->data;
            pre->next=NULL;
            r->next=pre;
            r=r->next;
            list1=list1->next;
            continue;
        }
        if(list1->data>list2->data)
        {
            pre->data=list2->data;
            pre->next=NULL;
            r->next=pre;
            list2=list2->next;
        }else{
            pre->data=list1->data;
            pre->next=NULL;
            r->next=pre;
            list1=list1->next;
        }
        r=r->next;
    }
    return head;
}

错误代码

struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2)
{
    struct ListNode *p,*q,*r,*head,*pre;
    p=list1;
    q=list2;
    r=NULL;
    if(p==NULL&&q==NULL)
    {
        return NULL;
    }else if(p==NULL){
        return list2;
    }else if(q==NULL){
        return list1;
    }
    if(p->data>q->data)
    {
        r->data=q->data;
        r->next=NULL;
        head=r;
    }else{
        r->data=q->data;
        r->next=NULL;
        head=r;
    }
    while(p!=NULL||q!=NULL)
    {
        r=(struct ListNode *)malloc(sizeof(struct ListNode));
        if(p==NULL)
        {
            pre->data=q->data;
            pre->next=NULL;
            r->next=pre;
            q=q->next;
        }else if(q==NULL)
        {
            pre->data=p->data;
            pre->next=NULL;
            r->next=pre;
            p=p->next;
        }
        if(p->data>q->data)
        {
            pre->data=q->data;
            pre->next=NULL;
            r->next=pre;
            q=q->next;
        }else{
            pre->data=p->data;
            pre->next=NULL;
            r->next=pre;
            p=p->next;
        }
        r=r->next;
    }
    return head;
}