《C++Primer》9.49

找出不出头的单词的字符串

#include<cstdlib>
#include <iostream>
#include <string>
#include <fstream>
#include <sstream>

using namespace std;

int main(int argc, char** argv)
{
	//查找不出头的单词
	string goal = { "acenmorsuvwxz" };
	string s;
	string::size_type pos = 0, pos1 = 0, pos2 = 0, max_pos1 = 0, max_pos2 = 0, s_length = 0;
	fstream infile("string.txt"); //打开文件
	if (infile) //如果打开成功
	{
		infile >> s;
		cout << "原字符串为" << s << endl;
		while ((pos1 = s.find_first_of(goal, pos1)) != string::npos) //找到目标字符的初始位置
		{
			//pos2 = pos1;
			for (pos1; pos1 != s.size() ; ++pos1)
			{
				if ((pos2 = s.find_first_not_of(goal, pos1)) != string::npos)//找到第一段目标字符的终止位置
				{
					pos = pos2 - pos1;
					if (s_length < pos)
					{
						//若为最长的字符串记录下对应的收尾位置及长度
						s_length = pos;
						max_pos1 = pos1;
						max_pos2 = pos2;
					}
					//++pos2; //递增下标
				}
				else //特殊情况为全是目标字符串
				{
					pos = s.size() - pos1;
					if (s_length < pos)
					{
						s_length = pos;
						max_pos1 = pos1;
						max_pos2 = s.size();
					}
				}
			}
		}
		string output_s = s.substr(max_pos1, s_length);
		cout << "最长的不出头的字符串为" << output_s << endl;		
		
	}
	else
	{
		cerr << "open failed." << endl;
	}
	return 0;
}