kuahao.txt

来自「数据结构及算法经典 讲述数据结构的经典算法c源程序」· 文本 代码 · 共 144 行

#include <stdio.h> 
#include <string.h> 
#include <stdlib.h> 

#define LEN 80 


typedef struct list 
{ 
char node; 
struct list* next; 
}list,*plist; 

void iniList(plist); 
int isEmpty(plist); 
int listAppend(plist,char); 
int delBracketsFormList(plist); 

int main(int argc,char* argv[]) 
{ 
FILE *in,*out; 
char test[LEN]; 
int i; 
list a; 
plist p; 
p=&a; 
iniList(p); 


in=fopen("correct.in","r"); 
out=fopen("correct.out","w"); 


fscanf(in,"%s",test); 

for (i=0;i<LEN;i++) 
{ 
switch(test[i]) 
{ 
case '[': 
case ']': 
case '{': 
case '}': 
case '(': 
case ')': 
listAppend(p,test[i]); 
break; 
default:continue; 
} 
} 
delBracketsFormList(p); 
if (isEmpty(p)) 
{ 
fprintf(out,"True\n"); 
} 
else 
fprintf(out,"False\n"); 



fclose(in); 
fclose(out); 
return 0; 
} 



void iniList(plist aplist) 
{ 
aplist->next=NULL; 
aplist->node='\0'; 
} 



int isEmpty(plist aplist) 
{ 
return aplist->next==NULL?1:0; 
} 



int listAppend(plist aplist,char a) 
{ 
plist bplist=aplist,anode; 

while (bplist->next) 
{ 
bplist=bplist->next; 
} 

anode=(plist)malloc(sizeof(list)); 

if (!anode) 
exit(-1); 
anode->node=a; 
anode->next=NULL; 
bplist->next=anode; 
return 0; 
} 



int delBracketsFormList(plist aplist) 
{ 
plist temp; 
int has=1; 
if (isEmpty(aplist)) 
return 0; 

while(has) 
{ 
has=0; 
temp=aplist; 
while (temp->next) 
{ 
if(temp->next->next) 
{ 
if((temp->next->next->node-temp->next->node==1)||(temp->next->next->node-temp->next->node==2)) 
{ 
temp->next = temp->next->next->next; 
has=1; 

} 
else 
temp = temp->next; 
} 
else 
temp =temp->next; 
if(!has) 
break; 
} 

} 
return 0; 
}