链表2.txt

利用vc开发工具

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define LEN sizeof(struct num )

struct num
{
    int data;
    struct num*next;
};
struct num *create(int n)
{
    //struct num*head;
    struct num *p1 = NULL,*p2 = NULL,*head = NULL;
    
    for (int i=1;i<=n;i++)
    {
        p2 = (struct num *)malloc(sizeof(LEN));
        if (p2 == NULL)
        {
            // fuck:)
        }
        
        p2->next = NULL;
        scanf("%d",&p2->data);
        
        if (i == 1)
        {
            head = p1 = p2;
        }
        else
        {
            p1->next = p2;
            p1 = p1->next;
        }
    }
    return head;
}

void bingji(struct num*a,struct num*b)
{
    struct num*head;
    struct num *p1,*p2;
    
    p1 = a;
    while (p1 != NULL)
    {
        printf("%d ",p1->data);
        p1 = p1->next;
    }
    
    p2 = b;
    while (p2 != NULL)
    {
        p1 = a;
        while (p1 != NULL)
        {
            if (p1->data == p2->data)
            {
                break;
            }
            p1 = p1->next;
        }
        
        if (p1 == NULL)
        {
            printf("%d ",p2->data);
        }
        p2 = p2->next;
    }
}

int main()
{ 
    int m,n;
    struct num *a,*b;
    printf("请输入集合a元素的个数:");
    scanf("%d",&m);
    printf("请输入集合a的元素:");
    a=create(m);
    
    printf("请输入集合b元素的个数:");
    scanf("%d",&n);
    printf("请输入集合b的元素:");
    b=create(n);
    
    bingji(a,b);
    
    
    system("pause");
    
    
    return 0;
}