1、先去除文件标点符号并且把大写改成小写。
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 30
typedef struct node
{
char s[30];
struct node* next;
int count;
}node,*List;
int FindInDict(node **dict,char *s);
//int FindInDict(List dict,char *s);
void InsertToDict(node **dict,char *s);
//void InsertToDict(List dict,char *s);
void FindTop(node *dict,List top[],int n);
int main(int argc,char **argv)
{
FILE *fp=fopen(argv[1],"r");
char ch;
char word[30];
int len=0;
int c_ch=0,c_line=0,c_word=0;
node *dict =(node *)calloc(26,sizeof(node)); //定义动态数组，存放的是相应单词的头结点
node *top[10]={0}; //存放排名前十的单词的指针（内存地址）
int i=0;
fseek(fp,0,SEEK_SET);
if(fp!=NULL)
{
while((ch=fgetc(fp))!=EOF)
//注意这里必须(ch=fgetc(fp)),因为!=优先级高，先算!=结果为1，不加()结果ch=1
{
c_ch++;
len=0;
while(ch>='a'&&ch<='z')
{
word[len++]=ch;
ch=fgetc(fp);
c_ch++;
}
if(len!=0)
{
word[len]='\0';
c_word++;
if(FindInDict(&dict,word)==0)
//if(FindInDict(dict,word)==0)
InsertToDict(&dict,word);
// InsertToDict(dict,word);
}
if(ch=='\n')
c_line++;
}
printf("the number of character is:%d\n", c_ch);
printf("the number of line is:%d\n", c_line + 1);
printf("the number of word is:%d\n", c_word);
FindTop(dict,top,10);
for(i=0;i!=10;++i)
printf("the top %2d word is %-10s, %d\n", i + 1, top[i]->s, top[i]->count);
}
else
perror("fopen:The_Holy_Bible_Res.txt");
system("pause");
return 0;
}
int FindInDict(node **dict,char *s)
{
int index=(s[0]-'a');
node *p=((*dict)+index)->next;
while(p!=NULL)
{
if(strcmp((p->s),s)<0)
p=p->next;
else if(strcmp(p->s,s)>0)
return 0;
else
{
p->count++;
return 1;
}
}
return 0;
}
|
void InsertToDict(List *dict,char *s)
{
int index=(s[0]-'a');
node *p=(*dict+index)->next;
node *word=(node *)malloc(sizeof(node));
word->count=1;
strcpy(word->s,s);
word->next=NULL;
if(NULL==p)
{
(*dict+index)->next=word;
}
else
{
if(strcmp(s,p->s)<0)
{
word->next=p;
(*dict+index)->next=word;
return;
}
while(p->next!=NULL)
{
if(strcmp(s,p->next->s)<0)
{
word->next=p->next;
p->next=word;
return;
}
else
p=p->next;
}
if(p->next!=word)
p->next=word;
}
}
int cmp(const void *a,const void *b) //List数组中任意两个元素的地址
{
List *i=(List*)a; //强制转换
List *j=(List*)b;
return ((*j)->count-(*i)->count);
}
void FindTop(List dict,List top[],int n)
{
node *p=dict;
node *q=p->next;
node *tmp[100000]={0};
int i,index=0;
while(p<dict+26)
{
while(q!=NULL)
{
tmp[index++]=q;
q=q->next;
}
p++;
q=p->next;
}
qsort(tmp,index,sizeof(List),cmp);
for(i=0;i<n;++i)
top[i]=tmp[i];
}
|
去除标点符号只要一个一个字符读，判断是标点符号就用空格代替；一个一个字符读是因为一行一行的读或者一个数组一个数组的读虽然能提高效率；但是有可能一个单词只读了一半在数组里数组就读满了，或者有些单词一行末尾没写完又转接写到下一行
