C++ Primer课后练习9.49

本文介绍了一个使用C++编写的程序,该程序从文件中读取单词,并通过检查这些单词是否包含某些升序和降序字母来找出最长的单词。程序利用了标准输入流和字符串操作。
练习9.49
#include
#include
#include
using namespace std;
int main(void)
{
	ifstream input("file.txt");
	if (!input)
		return -1;
	string word;
	string s_asscender("bdfhijklt");
	string s_descender("gpqy");
	string::size_type pos = 0;
	string max_size;
	
	while (input >> word)
	{
		if ((word.find_first_of(s_asscender, pos) == string::npos) &&
			(word.find_first_of(s_descender, pos) == string::npos) && (word.size()>=max_size.size()))
		{
			max_size = word;
			
		}
	}
	cout << max_size << endl;
	/*string s_whatever("abcdefghijklmnopqrstuvwxyz");
	cout << s_whatever << endl;
	string s_asscender("bdfhijklt");
	string s_descender("gpqy");
	string::size_type pos = 0;
	while ((pos = s_whatever.find_first_of(s_asscender, pos)) != string::npos)
	{
		s_whatever.erase(pos,1);
	}
	pos = 0;
	while ((pos = s_whatever.find_first_of(s_descender, pos)) != string::npos)
	{
		s_whatever.erase(pos, 1);
	}
	cout << s_whatever << endl;*/
	return 0;
}on a dark desert highway.   
cool wind in my hair.   
warm smell of colitas rising   
up through the air up ahead in the distance.   
i saw a shimmering light   
my head grew heavy and my sight grew dim   
i had to stop for the night   
there she stood in the doorway   
i heard the mission bell   
and i was thinking to myself   
this could be heaven or this could be hell   
then she lit up a candle   
and she showed me the way   
there were voices down in corridor   
i thought i heard them say......   
welcome to the hotel california   
such a lovely place (such a lovely face)   
there's plenty of rooms at the   
hotel california   
any time of year you can find it here   
her mind is tiffany-twisted   
she got the mercedes-benz   
she got a lot of pretty,   
pretty boys that she calls friends   
how they dance in the courtyard   
sweet summer sweat   
some dance to remember   
some dance to forget   
so i called up the captain   
please bring me my wine   
he said we haven't had that spirit   
here since nineteen sixty nine   
and still those voices are   
calling from far away   
wake you up in the middle of the night   
just to hear them say......   
welcome to the hotel   
calofornia such a lovely place   
(such a loveely face)   
they livin'it up at the hotel california   
what a nice surprise bring your alibis   
mirrors on the ceilling   
the pink champagne on ice   
and she said we are all just prisoners   
here of our own device   
and in the master's chambers   
they gathered for the feast   
they stab it with their steely knives   
but they just can't kill the beast   
last thing i remember,   
i was running for the door   
i had to find the passage back   
to the place i was before   
relax said programmed to receive   aaaaaaaaaaaaaaaaaaaaa
you can check out any time you like   
but you can never leave   
(Kriging_NSGA2)克里金模型结合多目标遗传算法求最优因变量及对应的最佳自变量组合研究(Matlab代码实现)内容概要:本文介绍了克里金模型(Kriging)与多目标遗传算法NSGA-II相结合的方法,用于求解最优因变量及其对应的最佳自变量组合,并提供了完整的Matlab代码实现。该方法首先利用克里金模型构建高精度的代理模型,逼近复杂的非线性系统响应,减少计算成本;随后结合NSGA-II算法进行多目标优化,搜索帕累托前沿解集,从而获得多个最优折衷方案。文中详细阐述了代理模型构建、算法集成流程及参数设置,适用于工程设计、参数反演等复杂优化问题。此外,文档还展示了该方法在SCI一区论文中的复现应用,体现了其科学性与实用性。; 适合人群:具备一定Matlab编程基础,熟悉优化算法和数值建模的研究生、科研人员及工程技术人员,尤其适合从事仿真优化、实验设计、代理模型研究的相关领域工作者。; 使用场景及目标:①解决高计算成本的多目标优化问题,通过代理模型降低仿真次数;②在无法解析求导或函数高度非线性的情况下寻找最优变量组合;③复现SCI高水平论文中的优化方法,提升科研可信度与效率;④应用于工程设计、能源系统调度、智能制造等需参数优化的实际场景。; 阅读建议:建议读者结合提供的Matlab代码逐段理解算法实现过程,重点关注克里金模型的构建步骤与NSGA-II的集成方式,建议自行调整测试函数或实际案例验证算法性能,并配合YALMIP等工具包扩展优化求解能力。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值