#include<stdio.h>
struct test
{
char a;
int cur;
};
void InitSpace(struct test *space)
{
int i;
for (i = 0; i < 100-1; i++)
{
space[i].cur = i + 1;
}
space[100 - 1].cur = 0;
}
int Malloc(struct test *space)
{
int i;
i = space[0].cur;
if (space[0].cur)
space[0].cur = space[i].cur;
return i;
}
void Free(struct test *space, int k)
{
space[k].cur = space[0].cur;
space[0].cur = k;
}
int different(struct test *space)
{
InitSpace(space);
int S,r, i, m, n,b,p,k;
int j;
S = Malloc(space);
r = S;
scanf("%d", &m); //A的个数
scanf("%d", &n); //B的个数
for (j = 1; j <= m; j++)
{
i = Malloc(space);
scanf("%c", &space[i].a);
space[r].cur = i;
r = i;
}
space[r].cur = 0;
for (j = 1; j <= n; j++)
{
scanf("%c", &b);
p = S;
k = space[S].cur;
while (k != space[r].cur&&space[k].a != b)
{
p = k;
k = space[k].cur;
}
if (k == space[r].cur)
{
i = Malloc(space);
space[i].a = b;
space[i].cur = space[r].cur;
space[r].cur = i;
}
else
{
space[p].cur = space[k].cur;
Free(space, k);
if (r == k)
r = p;
}
}
return S;
}
void print(struct test *space,int S)
{
int p = space[S].cur;
while (p)
{
printf("%c\n", space[p].a);
}
}
int main()
{
struct test space[100];
int S;
S=different(space);
print(space, S);
}
看的是严奶奶里的数据结构，但不知道问题出在哪里，理解什么备用链表也有点困难，求指点
differernt的作用是若B中存在A相同的则在A里删除，无则在A里面进行插入，
