3-3 编写程序计算它的输入中不同单词出现的次数
逻辑1:输入单词,输入一个遍历一次,有相同的统计加1,没有则新词入栈同时计数的向量长度加1。
逻辑2:全部进入vector中后排序,之后比较。
//统计输入中不同单词的个数
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
typedef vector<string>::size_type vec_sz;
vector<string> words;
vector<int> count;
cout << "input your words"
"followed by end-of-file";
string word;
//读入数据
while (cin >> word) {
bool found = false;
for (vec_sz i = 0; i < words.size(); i++) {
if (word == words[i]) //注意这边要用方括号
{
++count[i];
found = true;
}
}
if(!found) {
words.push_back(word);
count.push_back(1);
}
}
for (vec_sz i = 0; i < words.size(); ++i)
cout << words[i] << " appeared" << count[i] << " times" << endl