#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<&l
统计大于5个字母的单词的个数
最新推荐文章于 2021-05-22 02:48:49 发布
这篇博客介绍了一种方法来统计一段文本中所有单词里,长度超过5个字母的单词个数。通过这个过程,我们可以了解如何处理字符串数据并进行基本的文本分析。
摘要由CSDN通过智能技术生成