1 Star 0 Fork 0

L-L / firstwarehouse

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
Chinese statistics.cpp 1.58 KB
一键复制 编辑 原始数据 按行查看 历史
L-L 提交于 2020-04-04 16:42 . 红楼梦统计人物出现频率
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <sstream>
#include <assert.h>
using namespace std;
const int rangeNum = 10;
const int bufferSize = 409699;
char buffer[bufferSize];
char print[rangeNum][100] = {"宝玉","黛玉","贾母","凤姐","袭人","探春","宝钗","贾琏","平儿","贾政"};
int ans[rangeNum];
int main()
{
ifstream fin;
fin.open("D:\\红楼梦.txt"); //将文件流对象与文件连接起来
memset(ans, 0, sizeof(ans));
int ch, t = 0;
char c,cc,ccc,cccc;
cout << "请输入统计的章节号:";
cin >> ch;
//第 回
bool flg;
while (fin.getline(buffer, bufferSize))//查找章节
{
flg = false;
int k;
for (k = 0; k < 12; k++)
{
if (buffer[k] != '-') break;
}
if (k == 12)
{
t++;
if (t == (ch + 1))
{
flg = true;
break;
}
}
}
if(flg)
{
c = fin.get();
cc = fin.get();
ccc = fin.get();
while (c != EOF && c != '-')
{
cccc = fin.get();
for (int i = 0; i < rangeNum; i++)
{
if (c == print[i][0]&&cc == print[i][1]&& ccc == print[i][2]&& cccc== print[i][3])
{
++ans[i];
}
}
c = cc;
cc = ccc;
ccc = cccc;
}
}
for (int i = 0; i < rangeNum; ++i)
{
cout << print[i] << ":" << ans[i] << endl;
}
fin.close(); //关闭文件输入流
// 写文件
ofstream outFile;
outFile.open("Role.csv", ios::out); // 打开模式可省略
//outFile << "第"<<ch<<"回"<< endl;
outFile << "名称" << ',' << "第" << ch << "回出现次数" << endl;
for (int i = 0; i < rangeNum; i++)
{
outFile << print[i] << ',' << ans[i] << endl;
}
outFile.close();
getchar();
system("pause");
return 0;
}
C
1
https://gitee.com/Rachelee/firstwarehouse.git
git@gitee.com:Rachelee/firstwarehouse.git
Rachelee
firstwarehouse
firstwarehouse
master

搜索帮助