数据结构静态链表的应用

左手的ㄟ右手 2022-09-19 01:29 160阅读 0赞

#include <stdio.h>
    #include <stdlib.h>
    #include <iostream.h>
    
    #define MAXSIZE   100
    #define OK        1
    #define ERROR     0
    #define OVERFLOW  -2
    
    typedef char ElemType;
    
    
    typedef struct
    {
    	ElemType  data;
    	int cur;
    }component, SLinkList[MAXSIZE];
    
    
    void InitSpace_SL(SLinkList &space)
    {
    	int i;
    	for (i=0; i<MAXSIZE-1; i++)
    	{
    		space[i].cur = i+1;
    	}
    	space[MAXSIZE-1].cur = 0;
    }
    
    int Malloc_SL(SLinkList &space)
    {
    	int i;
    	i = space[0].cur;
    	if (space[0].cur)
    	{
    		space[0].cur = space[i].cur;
    	}
    	return i;
    }
    
    void Free_SL(SLinkList &space, int k)
    {
    	space[k].cur = space[0].cur;
    	space[0].cur = k;
    }
    
    void difference(SLinkList &space, int  &S)
    {
    	int r,k,i,j,m,n,p;
    	char b;
    	InitSpace_SL(space);
    	S = Malloc_SL(space);
    	r = S;
    	scanf("%d%d",&m,&n);
    	for (j=1; j<=m; ++j)
    	{
    		i = Malloc_SL(space);
    		scanf("%d",&space[i].data);
    		space[r].cur = i;
    		r = i;
    	}
    	space[r].cur = 0;
    	
    	for (j=1; j<=n; ++j)
    	{
    		scanf("%d",&b);
    		p = S;
    		k = space[S].cur;
    		while (k != space[r].cur && space[k].data != b)
    		{
    			p = k;
    			k = space[k].cur ;
    		}
    		if (k == space[r].cur )
    		{
    			i = Malloc_SL(space);
    			space[i].data = b;
    			space[i].cur = space[r].cur ;
    			space[r].cur = i;
    		}
    		else
    		{
    			space[p].cur = space[k].cur ;
    			Free_SL(space,k);
    			if (r == k)
    			{
    				r = p;
    			}
    		}
    	}
    }
    
    void print_SL(SLinkList space)
    {
    	int i = space[1].cur;
    	while (i)
    	{
    		printf("%d ",space[i].data);
    		i = space[i].cur;
    	}
    	printf("\n");
    }
    
    int main()
    {
    	SLinkList space;
    	int S;
    	difference(space, S);
    	print_SL(space);
    	return 0;
    }