C++ list 自定义类 指针排序方法

#include<stdio.h>
#include<iostream>
#include<list>
#include<string>
#include<algorithm>
#include <functional>

using namespace std;

class aa
{
public:
	int _b;
	aa(int c)
	{
		_b = c;
	}

	bool operator>(const aa& rhs)const
	{
		return _b > rhs._b ? true : false;
	}
};

template<>
struct std::greater<aa*>
{
	bool operator()(const aa* a1, const aa* a2) const
	{
		return *a1 > *a2;
	}
};

int main()
{
	std::list<aa*> ldd;



	ldd.push_back(new aa(2));
	aa* a2 = new aa(1);
	ldd.push_back(a2);
	aa* a3 = new aa(3);
	ldd.push_back(a3);
	aa * a4 = new aa(4);
	ldd.push_back(a4);
	for (aa* cc : ldd)
	{
		cout << cc->_b << endl;
	}
	ldd.sort(greater<aa*>()); // 排序

	for (aa* cc : ldd)
	{
		cout << cc->_b << endl;
	}

	system("pause");

	return 0;
}

参考的这篇文章,网上其他的不太好用,可能自己不会用吧。。

https://blog.csdn.net/flyelf/article/details/603514

发布了27 篇原创文章 · 获赞 5 · 访问量 1万+

猜你喜欢

转载自blog.csdn.net/jfztaq/article/details/82287723