数据结构——链表求两集合的交集

个人博客网站：https://www.liuzhi.org.cn/ 

#include <stdio.h>
#include <malloc.h>

typedef struct Node {
    int data;
    struct Node *next;
}LNode,*LinkList;

LNode *CreateList() { // 创建单循环链表，返回链表头
    LNode *head,*p;
    int i,n;
    scanf("%d",&n);
    head = p = (LNode *)malloc(sizeof(LNode)); // 专用头结点
    head->data = 0;
    for(i = 0; i < n; ++i) {
        p->next = (LNode *)malloc(sizeof(LNode));
        scanf("%d",&p->next->data);
        p = p->next;
    }
    p->next = head;
    return head;
}

LNode *MutualAgg(LNode *A,LNode *B) {  // A∩B
    LNode *C,*pa,*pb,*pc,*qc;
    C = pc = (LNode *)malloc(sizeof(LNode));
    pc->data = 0;
    pa = A->next;
    pb = B;
    while(pa != A) {
        pb = B->next;
        while(pb != B) {
            if(pb->data == pa->data) {
                qc = (LNode *)malloc(sizeof(LNode));
                qc->data = pb->data;
                pc->next = qc;
                pc = qc;
            }
            pb = pb->next;
        }
        pa = pa->next;
    }
    pc->next = C;
    return C;
}



void PrintList(LNode *head) {
    LNode *p = head->next;
    while(p != head) {
   
        printf("%d ",p->data);

        p = p->next;
    }
}

int main() {
    LNode *A,*B,*C,*D,*E;
    A = CreateList();
    B = CreateList();
    C = MutualAgg(A,B);
    PrintList(C);
    printf("\n\n");
    return 0;
}