当前位置: 首页>>代码示例>>C++>>正文


C++ DoubleLinkedList::count方法代码示例

本文整理汇总了C++中DoubleLinkedList::count方法的典型用法代码示例。如果您正苦于以下问题:C++ DoubleLinkedList::count方法的具体用法?C++ DoubleLinkedList::count怎么用?C++ DoubleLinkedList::count使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在DoubleLinkedList的用法示例。


在下文中一共展示了DoubleLinkedList::count方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: main


//.........这里部分代码省略.........
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;
	//DLL.reverse();
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;
	//DLL.reverse();
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;
	//DLL.addRear(1);
	//DLL.addRear(1);
	//DLL.addRear(1);
	//cout << DLL.count(1) << endl;
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;
	//cout << "\nTesting: addAt\n\n";
	//DLL.addAt(69,0);
	//DLL.addAt(69,DLL.size()-1);
	//DLL.addAt(69,DLL.size()/2);
	//DLL.addAt(69,DLL.size());
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;
	//cout << "size: " << DLL.size() << endl;
	//DLL.removeDuplicates();
	//for (size_t i = 0; i < DLL.size(); i++)//Print DLL
	//{
	//cout << DLL.at(i) << " ";
	//}
	//cout << endl;

	//Palindrome Test
	cout << "So you wanted to use my main. Well I was upset at this point. So enjoy my immaturity.\n";
	DoubleLinkedList<string> DLLS;
	DLLS.addRear("poop");
	DLLS.addRear("is");
	DLLS.addRear("good");
	DLLS.addRear("good");
	DLLS.addRear("good");
	DLLS.addRear("is");
	DLLS.addRear("poop");
	DLLS.addRear("good");
	DLLS.addFront("dino");
	DLLS.addAt("monkeybrain",rand()%DLLS.size());
	if (DLLS.contains("poop"))
		cout << "Has poop\n";
	cout << "Number of poops it has: " << DLLS.count("poop") << endl;

	for (size_t i = 0; i < DLLS.size(); i++)//Print DLL
	{
		cout << DLLS.at(i) << " ";
	}
	cout << endl;
	DLLS.removeDuplicates();
	for (size_t i = 0; i < DLLS.size(); i++)//Print DLL
	{
		cout << DLLS.at(i) << " ";
	}
	cout << endl;
	if (DLLS.isPalindrome())
		cout << "Sure is\n";
	else 
		cout << "Sure isn't\n";
	DLLS.shuffle();
	for (size_t i = 0; i < DLLS.size(); i++)//Print DLL
	{
	cout << DLLS.at(i) << " ";
	}
	cout << endl;
	DLLS.reverse();
	for (size_t i = 0; i < DLLS.size(); i++)//Print DLL
	{
	cout << DLLS.at(i) << " ";
	}
	cout << endl;
	while (DLLS.size() > 0)
	{
		DLLS.remove(rand()%DLLS.size());
		for (size_t i = 0; i < DLLS.size(); i++)//Print DLL
		{
			cout << DLLS.at(i) << " ";
		}
		cout << endl;
	}
	system("pause");
	return 0;
}
开发者ID:matthewkirk203,项目名称:CS235,代码行数:101,代码来源:Main.cpp


注:本文中的DoubleLinkedList::count方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。