C++
MingjaLee
这个作者很懒,什么都没留下…
展开
-
C++ STL map容器的排序(按key或value)
template < class Key, // map::key_type class T, // map::mapped_type class Compare = less<Key>,原创 2016-09-19 22:01:33 · 3601 阅读 · 0 评论 -
经典排序方法实现
冒泡排序选择排序插入排序快速排序堆排序希尔排序归并排序#include <iostream>#include <string>#include <algorithm>#include <vector>#include <map>#include <unordered_map>#include <string>using namespace std;vector<int> a原创 2016-09-21 00:50:44 · 595 阅读 · 0 评论 -
C++ priority_queue用法(大顶堆,小顶堆)
cplusplus.com template <class T, class Container = vector<T>, class Compare = less<typename Container::value_type> > class priority_queue; 例子#include <iostream>#include <string>#include <algori原创 2016-10-03 11:59:04 · 43369 阅读 · 3 评论