栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

《C++ primer》第九章

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

《C++ primer》第九章

#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

void f902()
{
	list> L1;
}
vector::iterator f905(int target)
{
	vector v{ 0,1,2,3,4,5 };
	vector::iterator beg = v.begin();
	vector::iterator end = v.end();
	for (vector::iterator it = beg; it != end; ++it)
	{
		if (*it == target)
		{
			return it;
		}
	}
	return end;
}
void f910()
{
	vector v1;
	const vector v2;
	vector::iterator it = v1.begin();
	//const vector::iterator it = v2.begin();
}
int f915()
{
	vector v1 = { 0,1,2,3,4,5 };
	vector v2 = { 0,1,2,3,4 };
	if (v1 == v2)
		return 0;
	else
		return -1;
}
int f916()
{
	list L1 = { 0,1,2,3,4,5 };
	vector v2 = { 0,1,2,3,4,5 };
	vector v1;
	v1.assign(L1.begin(), L1.end());
	if (v1 == v2)
		return 0;
	else
		return -1;
	
}
void f918()
{
	deque d1;
	string buff;
	while (cin >> buff)
	{
		if (buff == "exit")
			break;
		d1.push_back(buff);
	}
	
	for (deque::iterator it = d1.begin(); it != d1.end(); ++it)
	{
		cout << *it << endl;
	}
}
void f926()
{
	int a[] = { 0,1,1,2,3,5,8,13,21,55,89 };
	vector vec1(begin(a), end(a));
	list list1(begin(a), end(a));
	list::iterator list1_it = list1.begin();
	vector::iterator vec1_it = vec1.end();
	if ((*list1_it) % 2)
	{
		list1_it = list1.erase(list1_it);
	}
	if ((*vec1_it) % 2 == 0)
	{
		vec1_it = vec1.erase(vec1_it);
	}
	for (int i = 0; i < vec1.size(); ++i)
	{
		cout << vec1[i] << endl;
	}
}
void f927()
{
	forward_list flist = { 0,1,2,3,4,5,6,7,8,9 };
	forward_list::iterator prev = flist.before_begin();
	forward_list::iterator curr = flist.begin();
	while (curr != flist.end())
	{
		if (*curr % 2 == 1)
		{
			curr = flist.erase_after(prev);
		}
		else
		{
			prev = curr;
			++curr;
		}
	}
	for (forward_list::iterator it = flist.begin(); it != flist.end(); ++it)
	{
		cout << *it << " " << ends;
	}
	cout << endl;
}
void f928(forward_list flist, string s1, string s2)
{
	forward_list::iterator prev = flist.before_begin();
	forward_list::iterator curr = flist.begin();
	while (curr != flist.end())
	{
		if (*curr == s1)
		{
			flist.insert_after(curr,s2);
			for (forward_list::iterator it = flist.begin(); it != flist.end(); ++it)
			{
				cout << *it << " " << ends;
			}
			cout << endl;
			return;
		}
		prev = curr;
		++curr;
	}
	flist.insert_after(prev, s2);

	for (forward_list::iterator it = flist.begin(); it != flist.end(); ++it)
	{
		cout << *it << " " << ends;
	}
	cout << endl;
}
void test3()
{
	int a[10] = { 1,2,3,4,5 };
	string s1 = "weipengyan";
	string s3(a[0], 3);//???
	string s4(s1, 1);
	string s5(s1, 1, 4);
	cout << s3 << endl;
	cout << s4 << endl;
	cout << s5 << endl;
}
int main(int argc, char* argv[])
{
	//int result = f916();
	//string str = result==0 ? "相等" : "不相等";
	//cout << str << endl;

	//f918();
	//f926();
	//f927();
	//forward_list flist1 = { "wei","peng","yan" };
	//f928(flist1, "ww", "li");

	test3();
	system("pause");
	return 0;
}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/784433.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号