《C++ Primer》习题9.39

#include < iostream >
#include < vector >
#include < string >


using std::cout;
using std::cin;
using std::endl;
using std:: string ;
using std::vector;



int _tmain( int argc, _TCHAR * argv[])
{
string line1 = " We were her pride of 10 she named us: " ;
string line2 = " Benjamin, Phoenix, the Prodigal " ;
string line3 = " and perspicacious pacific Suzanne " ;

string sentence = line1 + ' ' + line2 + ' ' + line3;
string separator = " ,0123456789 " ; // 分隔符
string ::size_type pos = 0 ; // 当前位置
string ::size_type wordLength = 0 ,maxLength = 0 , minLength = 0 ; // 最长和最短单词的长度
int maxCount = 0 , minCount = 0 ; // 最长和最短单词的个数
string ::size_type startPos = 0 , endPos = 0 ; // 单词的位置

vector < string > maxWords;
vector < string > minWords;

// 用第一个单词初始化
pos = sentence.find_first_not_of(separator,pos);
startPos = pos;
pos ++ ;
pos = sentence.find_first_of(separator,pos);
endPos = pos;
maxLength = minLength = endPos - startPos;
maxWords.push_back(sentence.substr(startPos,maxLength));
minWords.push_back(sentence.substr(startPos,minLength));

while ((pos = sentence.find_first_not_of(separator,pos)) != string ::npos)
{
startPos = pos;
pos ++ ;
if ((pos = sentence.find_first_of(separator,pos)) != string ::npos)
{
endPos = pos;
wordLength = endPos - startPos;
if (maxLength < wordLength)
{
maxWords.clear();
maxLength = wordLength;
maxWords.push_back(sentence.substr(startPos,wordLength));
}
else if (maxLength == wordLength)
maxWords.push_back(sentence.substr(startPos,wordLength));
if (minLength > wordLength)
{
minWords.clear();
minLength = wordLength;
minWords.push_back(sentence.substr(startPos,wordLength));
}
else if (minLength == wordLength)
minWords.push_back(sentence.substr(startPos,wordLength));
pos ++ ;
}
}

system( " pause " );
return 0 ;
}

转载于:https://www.cnblogs.com/windroc/archive/2011/03/27/1997138.html