jingtai.h

数据结构实验报告等综合内容

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#define M 10
struct component
{
   int data;
   int cur;
};
  int loc_stalist(struct component sa[M],int x)
 {
    int j,z;
    j=sa[0].cur;
    while ((j!=-1)&& (sa[j].data!=x))
      j=sa[j].cur;
     z=j ;
     return(z);
 }
  void init_stalist( struct component * sp)
  {
   int i;
   for(i=0;i<=(M-1);i++)
   {
     (sp+i)->cur=i+1;
     (sp+M)->cur=-1;
   }
  }
  int getnode_stalist(int *av,struct component space[M])
  {
    int i,z;

    i=*av;
    if ((*av)!=-1)
      *av=space[*(av)].cur;
    z=i;
    return(z);
  }
  void disp_stalist(int av,int k)
  {
    struct component space[M];
    space[k].cur=av;
    av=k;
   }
 int difference(struct component space[M],int av,int sa)
 {
    int ra,m,n,x,i,j,k,pre,z;
    init_stalist(space);
    sa=getnode_stalist(&av,space);
    ra=sa;
	cout<<"Enter the LA\'s length:"<<endl;
    scanf("%d",&m);
	cout<<"Enter the LA\'s member:"<<endl;
    for(j=1;j<=m;j++)
    {
      scanf("%d",&x);
      i=getnode_stalist(&av,space);
      space[i].data=x;
      space[ra].cur=i;
      ra=i;
     }
     space[ra].cur=-1;
	cout<<"Enter the LB\'s length:"<<endl;
     scanf("%d",&n);
	cout<<"Enter the LB\'s member:"<<endl;
     for(j=1;j<=n;j++)
     {
	scanf("%d",&x);
	pre=sa;
	k=space[sa].cur;
	while((k!=space[ra].cur)&&(space[k].data!=x))
	{
	   pre=k;
	   k=space[k].cur;
	}
	   if (k==space[ra].cur)
	     {
		     i= getnode_stalist(&av,space);
		     space[i].data=x;
		     space[i].cur=space[ra].cur;
		     space[ra].cur=i;
		     ra=i;
	     }
	     else
	     {
		    space[pre].cur=space[k].cur;
		    disp_stalist(av,k);
		    av=k;
		    if (ra==k)
			 ra=pre;
	     }
	 }
	 z=sa;
	 return(z);
    }
  void puto(struct component space[M])
    {
       int i;
       i=0;
	   cout<<"The LC\'s member is:"<<endl;
     while (space[i].cur!=-1)
	{
	  i=space[i].cur;
	  printf("%d ",space[i].data);
	}
    }