C++STL算法 min_element,max_element,minmax_element [两个参数] 比较猫咪的年龄

重载了<和==

#include <iostream>
#include <cstdlib>
#include <deque>
#include <functional>
#include <algorithm>
#include <numeric>

using namespace std;
class Cat
{
public:
	Cat(int age)
	{
		this->age = age;
	}
private:
	int age;
public:
	bool operator<(Cat& c)const
	{
		return this->age < c.age;
	}
	bool operator==(int age)const
	{
		return this->age == age;
	}
	int getAge()
	{
		return this->age;
	}
};

int main()
{
	deque<Cat> catDeq;
	for (int i = 1; i != 10; ++i)catDeq.push_back(Cat(i));
	for (int i = 1; i != 5; ++i)catDeq.push_back(Cat(i));
	for (int i = 2; i != 6; ++i)catDeq.push_back(Cat(i));
	catDeq.push_back(Cat(9));
	catDeq.push_back(Cat(9));

	deque<Cat>::iterator iter;

	iter = max_element(catDeq.begin(), catDeq.end());
	cout << "年龄最大的猫咪的年龄是:" << (*iter).getAge() << endl;
	cout << "一共有 " << count(catDeq.begin(), catDeq.end(), (*iter).getAge()) << " 只" << endl;
	for (int max = (*iter).getAge(), cnt = 0; iter != catDeq.end(); ++iter)
	{
		iter = max_element(iter, catDeq.end());
		if (max == (*iter).getAge())
		{
			cout << "第" << ++cnt << "只猫咪的序号是:" << distance(catDeq.begin(), iter) << " (从0开始)" << endl;
		}
		else
		{
			break;
		}
	}
	

	iter = min_element(catDeq.begin(), catDeq.end());
	cout << "年龄最小的猫咪的年龄是:" << (*iter).getAge() << endl;
	cout << "一共有 " << count(catDeq.begin(), catDeq.end(), (*iter).getAge()) << " 只" << endl;
	for (int max = (*iter).getAge(), cnt = 0; iter != catDeq.end(); ++iter)
	{
		iter = min_element(iter, catDeq.end());
		if (max == (*iter).getAge())
		{
			cout << "第" << ++cnt << "只猫咪的序号是:" << distance(catDeq.begin(), iter) << " (从0开始)" << endl;
		}
		else
		{
			break;
		}
	}

	

	pair< deque<Cat>::iterator, deque<Cat>::iterator> resultPair = minmax_element(catDeq.begin(), catDeq.end());
	cout << "年龄最小的猫咪的年龄是:" << (*resultPair.first).getAge() << endl;
	cout << "一共出现了 " << count(catDeq.begin(), catDeq.end(), (*resultPair.first).getAge()) << " 次" << endl;
	cout << "其中一只出现的位置是:" << distance(catDeq.begin(), resultPair.first) << " (从0开始)" << endl;
	cout << "年龄最大的猫咪的年龄是:" << (*resultPair.second).getAge() << endl;
	cout << "一共出现了 " << count(catDeq.begin(), catDeq.end(), (*resultPair.second).getAge()) << " 次" << endl;
	cout << "其中一只出现的位置是:" << distance(catDeq.begin(), resultPair.second) << " (从0开始)" << endl;// 最后一只


	

	cout << "所有猫咪的年龄: [ ";
	for (deque<Cat>::iterator iter = catDeq.begin(); iter != catDeq.end(); ++iter)cout << (*iter).getAge() << " ";
	cout << "]" << endl;

	return EXIT_SUCCESS;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

淘汰猫とても

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值