#include
#include
#include
#include
typedef struct Lnode{
char *word;
int count;
struct Lnode *next;
}Lnode,*LinkList;
void InitList(LinkList *L);//链表初始化
void divide(LinkList ,char *);
void List_Insert(LinkList ,char *);
int main(){
FILE *fp;
if((fp = fopen("D:\input.txt","r"))==NULL){
printf("can not open this file.\n");
exit(0);
}
LinkList L;
InitList(&L);
LinkList p =L;
int i = 0;
char a[500];
while(!feof(fp))
a[i++] = fgetc(fp);
a[i-1] = '\0';
divide(L,a);
while(p->next!=NULL)
printf("%s %d",p->word,p->count);
fclose(fp);
return 0;
}
void InitList(LinkList *L){
*L = (LinkList)malloc(sizeof(struct Lnode));
(*L)->count = 0;
//(*L)->word = "\0";
(*L)->next = NULL;
}
void divide(LinkList L,char *a){
int i = 0, j = 0;
char temp[20];
while(a[i]!='\0'){
while(!isalpha(a[i])){
if(a[i]=='\0')break;
i++;
}
if(a[i]=='\0') break;
while(isalpha(a[i]))
temp[j++] = a[i++];
temp[j] = '\0';
j = 0;
List_Insert(L,temp);
//printf("%s\n",temp);
}
}
void List_Insert(LinkList L,char *temp ){
LinkList p = L;
LinkList s;
int sign = 0;
while(p->next!=NULL){
if(strcmp(p->word,temp)==0){
p->count ++;
sign = 1;
}
else{
p = p->next;
}
}
if(sign == 0){
s = (LinkList)malloc(sizeof(struct Lnode));
s->count = 1;
strcpy(s->word,temp);
s->next = p;
p->next = NULL;
}
}
