数据结构线性表顺序表的交集

布满荆棘的人生 2022-09-18 14:51 190阅读 0赞

#include <stdio.h>
    #include <stdlib.h>
    
    #define LIST_INIT_SIZE    100
    #define LISTLNCREMENT     10
    #define OK                1
    #define ERROR             0
    #define OVERFLOW          -2
    
    typedef int ElemType;
    
    typedef struct
    {
    	ElemType *elem;
    	int length;
    	int listsize;
    }SqList;
    
    
    int InitList_Sq(SqList &L)
    {
    	L.elem = (ElemType *) malloc(LIST_INIT_SIZE * sizeof(ElemType));
    	if (!L.elem)
    	{
    		exit(OVERFLOW);
    	}
    	L.length = 0;
    	L.listsize = LIST_INIT_SIZE;
    	return OK;
    }
    
    void Create_Sq(SqList &L, int n)
    {
    	int i;
    	for (i=0; i<n; i++)
    	{
    		scanf("%d",&L.elem[i]);
    	}
    	L.length = n;
    }
    
    void Display_Sq(SqList L)
    {
    	int i;
    	for (i=0; i<L.length ; i++)
    	{
    		printf("%d ",L.elem[i]);
    	}
    	printf("\n");
    }
    
    int Find(SqList L, ElemType e)
    {
    	int i = 0;
    	while (i<L.length)
    	{
    		if (L.elem[i] == e)
    		{
    			break;
    		}
    		++i;
    	}
    	if (i == L.length)
    	{
    		return 0;
    	}
    	return 1;
    }
    
    int ListDel_Sq(SqList &L, int i, ElemType &e)
    {
    	ElemType *p,*q;
    	if (i<1 || i>L.length+1)
    	{
    		return ERROR;
    	}
    
    	p = &(L.elem [i-1]);
    	e = *p;
    	q = L.elem + L.length - 1;
    	for (++p;p<=q;++p)
    	{
    		*(p-1) = *p;
    	}
    	--L.length ;
    	return OK;
    }
    
    int GetData(SqList L,int i)
    {
    	if (i<0 || i>L.length)
    	{
    		return ERROR;
    	}
    	else
    		return L.elem[i-1];
    }
    
    void SameinList_Sq(SqList &La, SqList Lb)
    {
    	int i = 1,e;
    	while (i<=La.length)
    	{
    		e = GetData(La,i);
    		if (!Find(Lb,e))
    		{
    			ListDel_Sq(La,i,e);
    		}
    		else
    		{
    			i++;
    		}
    
    	}
    }
    
    
    int main()
    {
    	int n;
    	SqList La,Lb;
    	InitList_Sq(La);
    	InitList_Sq(Lb);
    	printf("请输入链表La的长度: ");
    	scanf("%d",&n);
    	printf("请输入 %d 个数据: ",n);
    	Create_Sq(La,n);
    	printf("请输入链表Lb的长度: ");
    	scanf("%d",&n);
    	printf("请输入 %d 个数据: ",n);
    	Create_Sq(Lb,n);
    	SameinList_Sq(La,Lb);
    	if (La.length == 0)
    	{
    		printf("两个链表没有相同的元素!\n");
    	}
    	else
    	{
    		printf("两个链表相同的元素是: ");
    		Display_Sq(La);
    	}
    	return 0;
    }