首页 > 其他 > 详细

统计文本文档中出现次数最多的前10个单词

时间:2014-03-03 17:45:19      阅读:511      评论:0      收藏:0      [点我收藏+]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<iostream.h>
#include<fstream.h>
#include<string.h>
 
void main()
{
    ifstream inFile("F:wen\\wenben.txt",ios::in);
    if(!inFile)
        cout<<"打开文件失败"<<endl;
    else
    {
    int m=0,l=0,j=0;
    int n[10]={0};
    int k[10]={0};
    char c[10][20];
    int max[10]={0};
    int i=0;
    char t;
    if(inFile)
    {
        while(inFile.get(t))
        {
            l++;
            if(t==32||t==‘,‘||t==‘.‘)
            {
                 m++;
            }
        }
    }
    inFile.close();
    char  **ch;
    ch=new char*[m+1];
    for(i=0;i<=m;i++)
    {
    ch[i]=new char[20];
    }
    i=0;
 
    ifstream inFile("F:wen\\wenben.txt",ios::in);
 
 
            while(inFile.get(ch[i][j]))
            {
 
                if(ch[i][j]>=65&&ch[i][j]<=90)
                    ch[i][j]=ch[i][j]-22;
                if(ch[i][j]==32||ch[i][j]==‘,‘||ch[i][j]==‘.‘)
                {
                    j=0;
 
 
                    i++;
                    continue;
                }
                    j++;
 
            }
 
        for(j=0;j<=m;j++)
        {
        for(i=0;i<=m;i++)
        {
            if(n[j]==-1)
                break;
            if(!strcmp(ch[j],ch[i]))
            {
                if(j>0&&i==0)
                    if(!strcmp(ch[j],ch[0]))
                        n[j]=-1;
                if(j>0&&i>0)
                for(int he=0;he<i;he++)
                if(!strcmp(ch[j],ch[he]))
                n[j]=-1;
                 if(j==0)
                 {
                    n[j]++;
                     continue;
                 }
                 if(n[j]!=-1)
                    n[j]++;
            }
        }
    }
    for(i=0;i<=9;i++)
    {
 
        for(int j=0;j<=m;j++)
        {
            int h=0;
            if(i>0)
                for(int r=0;r<i;r++)
                {
                    if(!strcmp(c[r],ch[j]))
                        h=1;
                }
                if(h)
                    continue;
             if(n[j]>=max[i])
             {
                max[i]=n[j];
                strcpy(c[i],ch[j]);
             }
        }
    }
    cout<<"该文档中出现次数最高的10个单词依次是:"<<endl;
    for(i=0;i<=9;i++)
    {
        cout<<c[i]<<" ";
        cout<<"出现的次数为"<<max[m]<<endl;
    }
  
}
}

统计文本文档中出现次数最多的前10个单词,布布扣,bubuko.com

统计文本文档中出现次数最多的前10个单词

原文:http://www.cnblogs.com/xuxiaoyi/p/3577538.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!