统计大于5个字母的单词的个数

LiSCode

于 2020-09-13 13:05:20 发布

阅读量329

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/yonghengzhimi/article/details/108512268

这篇博客介绍了一种方法来统计一段文本中所有单词里，长度超过5个字母的单词个数。通过这个过程，我们可以了解如何处理字符串数据并进行基本的文本分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <cctype>
#include <stack>
#include <utility>
#include <map>
#include <algorithm>
#include <numeric>
using namespace std;
bool isShorter(const string &s1,const string &s2)
{
 return s1.size() < s2.size();
}
bool GT6(const string &s)
{
 return s.size() >= 5;
}
int main(int argc, char* argv[])
{ 
 vector<string> words;
 string nextWord;
// while (cin >> nextWord)
 {
  words.push_back("the");
  words.push_back("quick");
  words.push_back("red");
  words.push_back("fox");
  words.push_back("jumpe");
  words.push_back("over");
  words.push_back("the");
  words.push_back("slow");
  words.push_back("red");
  words.push_back("turtle");
 }
 sort(words.begin(),words.end());
 
 cout<<"--------排序后-----------"<<endl;
 for (vector<string>::iterator iter = words.be