该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
#include "string.h"
#include "ctype.h"
#include "limits.h"
#include "stdio.h"
#include "stdlib.h"
#include "math.h"
#include "process.h"
#define TRUE 1
#define FALSE 0
#define OK 1
#define INFEASIBLE -1
#define ERROR 0
typedef int status;
typedef int Boolean;
#define INITSIZE 100
#define INCREMENT 10
typedef struct{
char *elem;
int length;
int listsize;
}sqlist;
status Initsq(sqlist *L){
*L.elem=(char*)malloc(INITSIZE*sizeof(char));
if(!*L.elem)exit(OVERFLOW);
*L.listsize=INITSIZE;
return OK;
}
void listinsert(sqlist *L,int i,char e)
{ int k;
int n=*L.elem.length;
for(k=n;k>i;i--)
*L.elem[n]=*L.elem[n-1];
*l.elem[i]=e;
}
void shuchu(sqlist *L)
{ int k;
for(k=0;k
printf("%c",*L.elem[k]);
}
void Enter(sqlist *la,sqlist *lb)
{ int i=1,j=1;char ch;
printf("please enter la:");
ch=getchar();
do
{ Listinsert(la,i,ch);
ch=getchar();
i++;
}whilh(ch!=0)
printf("/nplease enter lb:");
ch=getchar();
do
{ Listinsert(lb,j,ch);
ch=getchar();
j++;
}whilh(ch!=0)
}
void hunhe(sqlist *la,sqlist *lb)
{ int k=0,i,j,a,b;
a=*la.length;b=*lb.length;
for(i=0;i
{for(j=0;i
{if(*lb.elem[i]==*(la.elen[j])
k=1;
}
if(k==0)listinsert(la,a+1,*lb.elem[j-1]);
}
}
main()
{ sqlist *la,*lb;
Initsq(la);Initsq(lb);
Enter(la,lb);
printf("la=/n");
shuchu(la);
printf("lb=/n");
shuchu(lb);
hunhe(la,lb);
shuchu(la);
}