算法-区间的比较

#include<iostream>
#include<vector>
#include<list>
#include<algorithm>
#include<functional>

using namespace std; 

//设计一个函数对象
bool bothEvenOrOdd(int elem1, int elem2)
{
	return elem1 % 2==elem2 % 2;
}

//使用谓词
void printCollection(const list<int>& l)
{
	for (list<int>::const_iterator iter = l.begin(); iter != l.end(); ++iter)
		cout << *iter << " ";
	cout << endl;
}

bool  lessForCollection(const list<int>&list1,const list<int>& list2)
{
	return lexicographical_compare(list1.begin(), list1.end(), list2.begin(), list2.end());
}


int main()
{
	vector<int> ivec;
	list<int> ilist;
	for (int i = 1; i <= 7; ++i)
		ivec.push_back(i);
	for (int i = 3; i <= 9; ++i)
		ilist.push_back(i);

	for (vector<int>::iterator iter = ivec.begin(); iter != ivec.end(); ++iter)
		cout << *iter <<" ";
	cout << endl;
	for (list<int>::iterator iter = ilist.begin(); iter != ilist.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	if (equal(ivec.begin(), ivec.end(), ilist.begin()))//比较是否相等
		cout << "xiangdeng" << endl;
	else
		cout << "no equal" << endl;

	//传输进去一个谓词,奇数对应奇数，偶数对应偶数
	if (equal(ivec.begin(), ivec.end(), ilist.begin(), bothEvenOrOdd))
		cout << "这两个区间是奇数对应奇数，偶数对应偶数" << endl;
	else
		cout << "error" <<endl;

	//在比较的过程中找到第一个不相等的数
	vector<int> ivec1;
	list<int> ilist1;
	for (int i = 1; i <= 6; ++i)
		ivec1.push_back(i);
	for (int i = 1; i <= 16; i*=2)
		ilist1.push_back(i);
	ilist1.push_back(3);
	for (vector<int>::iterator iter = ivec1.begin(); iter != ivec1.end(); ++iter)
		cout << *iter << " ";
	cout << endl;
	for (list<int>::iterator iter = ilist1.begin(); iter != ilist1.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	//算法在比较的过程中返回值是个pair
	pair<vector<int>::iterator,list<int>::iterator > values;//第一个指向第一个容器里不相等的数,第二个指向第二个不相等的数
	values =mismatch(ivec1.begin(), ivec1.end(), ilist1.begin());//没有找到不相等的数
	if (values.first == ivec1.end())
		cout << "没有找到不相等的数" << endl;
	else
		cout << "find ok：" <<*values.first<< " "<<*values.second<<endl;

	values = mismatch(ivec1.begin(), ivec1.end(), ilist1.begin(), less_equal<int>());//如果第一个容器里的数大于第二个容器里的数，就是找到了
	if (values.first == ivec1.end())
		cout << "error" << endl;
	else
		cout << "ok:find a big::" << *values.first << "  and  " << *values.second<< endl;;
	
	//检查第一个是不是小于第二个区间，检查小于算法
	//数大的区间大于数少的区间
	//结果ture：第一个区间比第二个区间小，false，两个区间相等
	list<int> a1,a2,a3,a4;
	for (int i = 1; i <= 5; ++i)
		a1.push_back(i);
	a4 = a3 = a2 = a1;
	a1.push_back(7);
	a3.push_back(2);
	a3.push_back(0);
	a4.push_back(2);

	printCollection(a1);
	printCollection(a2);
	printCollection(a3);
	printCollection(a4);

	vector<list<int>> aa;//把a1和a2，a3,a4保存在向量里
	aa.push_back(a1);
	aa.push_back(a2);
	aa.push_back(a3);
	aa.push_back(a4); 

	if (lexicographical_compare(a4.begin(),a4.end(), a1.begin(), a1.end()))
		cout << "a4小于a1" << endl;
	else
		cout << "a4和a1相等" << endl;
	if (lexicographical_compare(a4.begin(), a4.end(), a3.begin(), a3.end()))
		cout << "a4小于a3" << endl;
	else
		cout << "a4和a3大于相等" << endl;

	for_each(aa.begin(), aa.end(), printCollection);
	cout << endl;
	//排序,小的在前边，大的在后边
	sort(aa.begin(), aa.end(), lessForCollection);
	for_each(aa.begin(), aa.end(), printCollection);
	cout << endl;

	system("pause");
	return 0;
}