删除第一个链表中与第二个链表重复的节点

[size=medium]有两个链表a和b，设结点中包含学号、姓名。从a链表中删去与b链表中有相同学号的那些结点。[/size]

#include<stdio.h>
struct Node
{
    int data;
    struct Node *next;
};

//创建链表
struct Node *create(int n,int count)
{
    int i;
    struct Node *head,*p1,*p2;
    head = p1 = p2 = (struct Node*)malloc(sizeof(struct Node));
    head->data = n;
    for(i=1; i<count; i++)
    {
        p1 = (struct Node*)malloc(sizeof(struct Node));
        p1->data = i+n;
        p2->next = p1;
        p2 = p1;
    }
    p2->next = NULL;
    return head;
}

//从p1中删除和p2重复的
void delSame(struct Node *p1, struct Node *p2)
{
    int flag;
    struct Node *p11,*p22,*t;
    p11 = p1;
    p22 = p1;
    while(p11 != NULL)
    {
        flag = 0;
        while(p22 != NULL)
        {
            if(p11->data == p22->data)
            {
                printf("删除%d\n", p11->data);
                t = p11->next;
                p11->data = t->data;
                p11->next = t->next;
                free(t);
                flag = 1;
                break;
            }
            p22 = p22->next;
        }
        p22 = p2;
        if(flag == 0)
        {
            p11 = p11->next;
        }
    }
}

void main()
{
    struct Node *p1,*p11,*p2,*p22,*p3;
    //创建链表
    p11 = p1 = create(3,5);
    p22 = p2 = create(0,7);

    printf("链表1初始数据：\n");
    while(p1)
    {
        printf("%d\n", p1->data);
        p1 = p1->next;
    }

    printf("\n链表2初始数据：\n");
    while(p2)
    {
        printf("%d\n", p2->data);
        p2 = p2->next;
    }

    printf("\n从链表1中删去与链表2相同的结点后的链表1的内容：\n");
    delSame(p11,p22);
    while(p11)
    {
        printf("%d\n", p11->data);
        p11 = p11->next;
    }
}