数据结构上机题

#include

#include

#include

#include

#include

#define null 0

#define M 100

//typedef int Elemtype;这里定义了却没用，可见思维不连惯struct Lnode

{

// int num;

char data;

struct Lnode *next;

};

int lenth(struct Lnode **L)

{

int n=0;

struct Lnode *t;

t=*L;

while(t!=null)

{

n++;

t=t-> next;

}

return n;

}

/*

int lenth1(char r[])

{

int n=0;

n=sizeof(r);

return n-1;

}*/

void creat(struct Lnode**L)

{

*L=null;

}

//void insert(struct Lnode**L,int n, char d)

//从功能化分上，这个函数不需要知道现在插入第几个字符//困为你init函数中是先对一个串的字符进行了排序，所以//这里直接插入链表的尾部就行了

void insert(struct Lnode**L, char d)

{

struct Lnode *t1,*t2;

int j=1;

t1=(struct Lnode*)malloc(sizeof(struct Lnode));

t1-> data=d;

t1-> next=NULL;

if(*L==NULL)

{

*L=t1;

return;

}

t2=*L;

while(t2-> next!=NULL)

{

t2=t2-> next;

}

t2-> next=t1;

/*

if(n==1)

{

t1-> next=t2;

*L=t1;

}

else

{

while(j next!=null)

{

t2=t2-> next;

j++;

}

if(j==n-1)

{

t1-> next=t2-> next;

t2-> next=t1;

}

else

{

cout < < "Insert error! ";

}

}*/

}

/*显示链表*/

void display(struct Lnode **L)

{

struct Lnode *t;

t=*L;

if(t==null)

{

cout << "The link is null! ";

}

else

{

for(;t!=null;)

{

cout < data;

t=t-> next;

}

}

cout << "\n ";

}

/* 初始化和排序*/

void init(struct Lnode**L,int n,char str[]) {

int i,j,k,x=0,p=0;

char ti,d[100];//,r[100]。

//struct Lnode*t;

for(i=0;i <=n-1;i++)

{

d[i]=str[i];

}

for(j=0;j

for(k=j+1;k <=n-1;k++)

{

if(int(d[j])> int(d[k]))

{

ti=d[j];

d[j]=d[k];

d[k]=ti;

//cout <

}

}

/*for(j=0;j

因为前面已排过序，就不需要两个for循环了,直接比较一下

这个字符和刚才插入链表的是否一样，一样就不再插入就行了。

for(k=j+1;k <=n-1;k++)

{

if(d[j]==d[k])

{

x++;

d[j]=d[k];

cout < < "123 ";

cout <

for(int m=k;m

{

d[m]=d[m+1];

}

n--;

}

} */

creat(&*L);

//for(int h=1;h <(n;h++)

//{

// insert(&*L,h,d[h]);

//}

if(n> 0)

insert(&*L,d[0]);//第一个字符是要插入的

for(int h=1;h

{

if(d[h] != d[h-1])

insert(&*L,d[h]);

}

// cout < < "The data of the linktable is: ";

// display(&*L);

}

/*删除指定位置的节点*/

void delet(struct Lnode **L,int n)

{

int i=1;

struct Lnode *t1,*t2;

t1=*L;

if(n==1)

t2=t1;

*L=t1-> next;

}

else

{

while(i next!=null)

{

t1=t1-> next;

i++;

}

if(t1-> next!=null&&i==n-1)

{

t2=t1-> next;

t1-> next=t2-> next;

}

else

{

cout << "Delete error!\n ";

}

}

if(t2==null)

{

free(t2);

}

}

/*返回指定节点的值*/

char get(struct Lnode **L,int n)

{

int i=1;

struct Lnode *t;

t=*L;

while (i

{

t=t-> next;

i++;

}

if(t!=null)

{

return(t-> data);

}

else

cout << "The Lnode haven 't find !\n ";

}

return(t-> data);

}

void copy(struct Lnode **L1,struct Lnode **L2 )

{

struct Lnode *t=*L1;

//int i,len;

//char t;

//len=lenth(&*L1);

creat(&*L2);

//for(i=1;i <=len;i++)

//{

// t=get(&*L1,i);

//insert(&*L2,i,t);

//}

while(t != NULL)

{

insert(&*L2,t-> data);

t=t-> next;

}

}

/*求交集*/

void intersection(struct Lnode **L1,struct Lnode **L2,struct Lnode **L3) {

/*int i,j,k=1;*/

struct Lnode *t1,*t2;

t1=*L1;

t2=*L2;

creat(&*L3);

/* for(i=1;i <=lenth(&*L1);i++)//用数组的思维操作链表，毙

{

for(j=1;j <=lenth(&*L2);j++)

{

if(t1-> data==t2-> data)

{

//insert(&*L3,k,t1-> data);

k++;

}

t2=t2-> next;

}

t1=t1-> next;

t2=*L2;

}*/

while(t1 != NULL && t2 != NULL)

{

if(t1-> data==t2-> data )

{

insert(&*L3,t1-> data);

t1=t1-> next;

t2=t2-> next;

}

else if(t1-> data data)

{

t1=t1-> next;

}

else//t1-> data> t2-> data

{

t2=t2-> next;

}

}

}

/*求并集*/

void unionset(struct Lnode **L1,struct Lnode **L2,struct Lnode **L3) {/*int i,j,k;*/

struct Lnode *t1,*t2;

creat(&*L3);

//copy(&*L1,&*L3);

t1=*L1;

t2=*L2;

while(t1 != NULL && t2 != NULL)

{

if( t1-> data==t2-> data )

{

insert(&*L3,t1-> data);

t1=t1-> next;

t2=t2-> next;

}

else if( t1-> data data)

{

insert(&*L3,t1-> data);

t1=t1-> next;

}

else//t1-> data> t2-> data

{

insert(&*L3,t2-> data);

t2=t2-> next;

}

}

if(t1==NULL)

{

while(t2!=NULL)

{

insert(&*L3,t2-> data);

t2=t2-> next;

}

}

else//(t2==NULL)

{

while(t1!=NULL)

{

insert(&*L3,t1-> data);

t1=t1-> next;

}

}

}

/*求差集*/

void diffrenceset(struct Lnode **L1,struct Lnode **L2,struct Lnode **L3) {

struct Lnode *t1=*L1;

struct Lnode *t2=*L2;

creat(&*L3);

while(t1 != NULL )

{

if(t2==NULL || t1-> data data )

{

insert(&*L3,t1-> data);

t1=t1-> next;

}

else if(t1-> data> t2-> data)//t2!=NULL

{

t2=t2-> next;

}

else//t1-> data==t2-> data

{

t1=t1-> next;

t2=t2-> next;

}

}

}

void main()

{

int len1=0,len2=0;

//char r[100],r1[100];

char r1[100],r2[100];

//cin> > r1[100];

cin>> r1;

int i=0;

while(r1[i++]!= '\0 ')

{

len1++;

}

cin>> r2;

int x=0;

while(r2[x++]!= '\0 ')

{

len2++;

}

// cout < < "123 ";

static struct Lnode *head1,*head2,*head3,*head4,*head5,*head6;

init(&head1,len1,r1);

cout << "Setl: ";

display(&head1);

// cout < < "Please input the lenth of the first linktable! ";

init(&head2,len2,r2);

cout << "Set2: ";

display(&head2);

intersection(&head1,&head2,&head3);

cout << "Setl∩Set2: ";

display(&head3);

unionset(&head1,&head2,&head4);

cout << "Setl∪Set2: ";

display(&head4);

diffrenceset(&head1,&head2,&head5);

cout << "Setl-Set2: ";

display(&head5);

}