蔡子经数据结构1.15

#include <stdlib.h>

typedef struct 
{
    int val;
    struct * next;
} node;

node* createNode()
{
    node *ret = (node*)malloc(sizeof(node));
    ret->val = 0;
    ret->next = NULL;
    return ret;
}

node* createLink(int n)
{
    node *head = createNode();
    for(int i = 0; i < n; ++i)
    {
        node *p = createNode();
        p->val = rand()%100;
        p->next = head->next;
        head->next = p;
    }
    return head;
}

node* merge(node *x, node *y)
{
    node *head = createNode();
    node *px = x->next;
    free(x);
    node *py = y->next;
    free(y);
    node *ph = head;
    while(px && py)
    {
        node *tx = px;
        px = px->next;
        node *ty = py;
        py = py->next;
        tx->next = ty;
        ty->next = NULL;
        ph->next = tx;
        ph = ty;
    }
    if(px) ph->next = px;
    if(py) ph->next = py;
    return head;
}

void print(node *p)
{
    p = p->next;
    while(p)
    {
        printf("%d ",p->val);
        p = p->next;
    }
    puts("");
    return ;
}

int main()
{
    srand(time(NULL));
    node *x = createLink(5);
    print(x);
    node *y = createLink(6);
    print(y);
    node *head = merge(x, y);
    print(head);
    return 0;
}