Re: [問題] 統計string中單字出現的次數
其實我一直很好奇你們幹嘛不 std::map<字串, 次數>？
（或 unordered_map, hash_map 隨便）
typedef CtnerType std::map<std::string, size_t> word_count ;
Ctner word_count ;
while ( cin >> s ) {
word_count[s]++ ;
}
CtnerType::const_iterator ker = std::max_element(
word_count.begin(),
word_count.end(),
[](const CtnerType::const_iterator& i) {
return i->second ;
};)
std::cout << ker->first << "出現 "
<< ker->second << " 次。"
<< std::endl ;
還是我哪邊想漏了？其實不能這樣用 O_O？
--
To iterate is human, to recurse, divine.
遞迴只應天上有, 凡人該當用迴圈. L. Peter Deutsch
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.160.108.180
→
09/06 11:14, , 1F
09/06 11:14, 1F
→
09/06 11:15, , 2F
09/06 11:15, 2F
推
09/06 11:16, , 3F
09/06 11:16, 3F
→
09/06 11:16, , 4F
09/06 11:16, 4F
→
09/06 11:27, , 5F
09/06 11:27, 5F
→
09/06 11:39, , 6F
09/06 11:39, 6F
→
09/06 12:48, , 7F
09/06 12:48, 7F
→
09/06 14:48, , 8F
09/06 14:48, 8F
推
09/06 15:40, , 9F
09/06 15:40, 9F
→
09/06 15:40, , 10F
09/06 15:40, 10F
→
09/06 15:41, , 11F
09/06 15:41, 11F
→
09/06 15:41, , 12F
09/06 15:41, 12F
→
09/06 15:42, , 13F
09/06 15:42, 13F
→
09/06 15:42, , 14F
09/06 15:42, 14F
→
09/06 15:44, , 15F
09/06 15:44, 15F
→
09/06 16:55, , 16F
09/06 16:55, 16F
→
09/06 17:00, , 17F
09/06 17:00, 17F
→
09/06 17:09, , 18F
09/06 17:09, 18F
討論串 (同標題文章)
完整討論串 (本文為第 4 之 4 篇)：