数据结构-链表的归并-C

数据结构实验之链表四：链表的归并

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

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

struct node * build(int n);
void output(struct node *head);

int main()
{

    int m, n;
    scanf("%d %d", &m, &n);
    struct node *head1 = build(m);
    struct node *head2 = build(n);
    struct node *head, *tail, *p, *q;
    head = (struct node *)malloc(sizeof(struct node));
    head ->next = NULL;
    tail = head;
    p = head1 ->next;
    q = head2 ->next;
    while(p&&q)
    {
        if(p ->data <= q ->data)
        {
            tail ->next = p;
            tail = p;
            p = p ->next;
        }
        else
        {
            tail ->next = q;
            tail = q;
            q = q ->next;
        }
    }
    if(p)
    {
        tail ->next = p;
    }
    else
    {
        tail ->next = q;
    }
    output(head);
    return 0;
}

struct node * build(int n)
{
    int i;
    struct node *head, *tail, *p;
    head = (struct node *)malloc(sizeof(struct node));
    tail = head;
    for(i = 0; i < n; i++ )
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p ->data);
        p ->next = NULL;
        tail ->next = p;
        tail = p;
    }
    return head;
}

void output(struct node *head)
{
    struct node *p = head ->next;
    while(p)
    {
        if(p)
            printf("%d ", p ->data);
        else
            printf("%d\n", p ->data);
        p = p ->next;
    }
}