#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
using namespace std;
//队列（没有迭代器）
/*
void main()
{
queue<int> q;
q.push(78);
q.push(18);
q.push(20);
q.push(33);
//q.front();
//q.back();
while (!q.empty())
{
int tmp = q.front();
cout << tmp << endl;
q.pop();
}
system("pause");
}
*/
//优先级队列
/*
#include <functional>
void main()
{
//默认 最大值优先级
priority_queue<int> pq1;
pq1.push(12);
pq1.push(3);
pq1.push(40);
pq1.push(15);
while (!pq1.empty())
{
int tmp = pq1.top();
cout << tmp << endl;
pq1.pop();
}
cout << "----------" << endl;
//最小值优先级队列
priority_queue<int, vector<int>,greater<int>> pq2;
pq2.push(12);
pq2.push(3);
pq2.push(40);
pq2.push(15);
while (!pq2.empty())
{
int tmp = pq2.top();
cout << tmp << endl;
pq2.pop();
}
system("pause");
}
*/
//栈
/*
#include <stack>
void main()
{
stack<int> s;
for (int i = 0; i < 10; i++)
{
s.push(i+1);
}
while (!s.empty())
{
int tmp = s.top();
cout << tmp << endl;
s.pop();
}
system("pause");
}
*/
//list
#include <list>
void printList(list<int>& lst)
{
//迭代器
//没有重载“<”运算符
for (list<int>::iterator it = lst.begin(); it != lst.end(); it++)
{
cout << *it << endl;
}
}
//基本操作
/*
void main()
{
list<int> lst;
for (int i = 0; i < 10; i++)
{
//尾部插入元素
lst.push_back(i);
}
//头部插入元素
lst.push_front(80);
lst.push_front(90);
list<int>::iterator it = lst.begin();
it++;
cout << *it << endl;
//it = it + 3; 注意：不支持随机访问
printList(lst);
system("pause");
}
*/
//删除
/*
void main()
{
list<int> lst;
for (int i = 0; i < 10; i++)
{
//尾部插入元素
lst.push_back(i);
}
list<int>::iterator it = lst.begin();
//删除
it++;
//删除第二个元素
//lst.erase(it);
//删除区间（已经被删除了元素不能再删除）
list<int>::iterator it_begin = lst.begin();
list<int>::iterator it_end = lst.begin();
it_end++;
it_end++;
it_end++;
lst.erase(it_begin, it_end);
//直接根据内容删除元素
lst.remove(5);
printList(lst);
system("pause");
}
*/
//list插入（应用：频繁的修改）
//vector（应用：随机访问v[100]）
/*
void main()
{
list<int> lst;
for (int i = 0; i < 10; i++)
{
//尾部插入元素
lst.push_back(i);
}
list<int>::iterator it = lst.begin();
it++;
lst.insert(it, 100);
printList(lst);
system("pause");
}
*/
//set 元素唯一 默认从小到大
#include <set>
void printSet(set<int> &s)
{
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
{
cout << *it << endl;
}
}
/*
void main()
{
set<int> s;
//添加元素
for (int i = 0; i < 10; i++)
{
s.insert(i+1);
}
s.insert(20);
s.insert(15);
s.insert(15);
//删除
set<int>::iterator it = s.begin();
it++;
s.erase(it);
printSet(s);
system("pause");
}
*/
//元素按照从大到小排列
/*
#include <functional>
void main()
{
//同Java中：Map<String,List<String>>
set<int,greater<int>> s;
s.insert(10);
s.insert(5);
s.insert(20);
s.insert(99);
for (set<int,greater<int>>::iterator it = s.begin(); it != s.end(); it++)
{
cout << *it << endl;
}
system("pause");
}
*/
//元素类型为Teacher对象，按照年龄排序
/*
class Teacher
{
public:
Teacher(char* name, int age)
{
this->name = name;
this->age = age;
}
void print()
{
cout << name << "," << age << endl;
}
public:
char* name;
int age;
};
//自定义排序规则
//仿函数
struct MyAgeSorter
{
bool operator()(const Teacher &left, const Teacher &right)
{
return left.age < right.age;
}
};
void main()
{
set<Teacher, MyAgeSorter> s;
s.insert(Teacher("jack",18));
s.insert(Teacher("rose", 20));
s.insert(Teacher("jason", 22));
s.insert(Teacher("alan", 5));
//s.insert(Teacher("jimy", 5)); //不会插入
for (set<Teacher>::iterator it = s.begin(); it != s.end(); it++)
{
cout << (*it).name << "," << (*it).age << endl;
}
system("pause");
}
*/
//set查找
/*
void main()
{
set<int> s;
//添加元素
for (int i = 0; i < 10; i++)
{
s.insert(i + 1);
}
//printSet(s);
//等于4的元素指针
set<int>::iterator s_4 = s.lower_bound(4);
//cout << *s_4 << endl;
//大于4的元素指针
set<int>::iterator s_5 = s.upper_bound(4);
//cout << *s_5 << endl;
//一次性获取等于4的元素指针，和大于4的元素指针\
//BasicNameValuePair
pair<set<int>::iterator, set<int>::iterator> p = s.equal_range(4);
cout << *p.first << endl;
cout << *p.second << endl;
system("pause");
}
*/
//multiset 允许重复的元素
/*
void main()
{
multiset<int> s;
s.insert(2);
s.insert(8);
s.insert(2);
s.insert(8);
for (multiset<int>::iterator it = s.begin(); it != s.end(); it++)
{
cout << *it << endl;
}
system("pause");
}
*/
//map添加元素的方式
#include <map>
#include <string>
/*
void main()
{
//key -> value
//1.
map<int, string> map1;
map1.insert(pair<int, string>(1,"jack"));
map1.insert(pair<int, string>(2, "rose"));
//2
map1.insert(make_pair(3,"jason"));
//3
map1.insert(map<int,string>::value_type(4,"alan"));
//4
map1[5] = "jimmy"; //map["NO1"] = 90;
//前三种方式，如果key已经存在，重复添加会报错
//第四种方式，如果key已经存在，重复添加会覆盖
//遍历输出
for (map<int, string>::iterator it = map1.begin(); it != map1.end(); it++)
{
cout << it->first << "," << it->second << endl;
}
system("pause");
}
*/
void printMap(map<int, string> &map1)
{
for (map<int, string>::iterator it = map1.begin(); it != map1.end(); it++)
{
cout << it->first << "," << it->second << endl;
}
}
//删除
/*
void main()
{
map<int, string> map1;
map1.insert(pair<int, string>(1, "jack"));
map1.insert(pair<int, string>(2, "rose"));
map1.insert(pair<int, string>(3, "jason"));
map<int, string>::iterator it = map1.begin();
it++;
map1.erase(it);
printMap(map1);
system("pause");
}
*/
//添加的结果
/*
void main()
{
map<int, string> map1;
map1.insert(pair<int, string>(1, "jack"));
map1.insert(pair<int, string>(2, "rose"));
map1.insert(pair<int, string>(3, "jason"));
//获取添加的结果（first元素指针，second 是否成功）
pair<map<int, string>::iterator, bool> res = map1.insert(pair<int, string>(3, "alan"));
if (res.second)
{
cout << "添加成功" << endl;
}
else
{
cout << "添加失败" << endl;
}
printMap(map1);
system("pause");
}
*/
//查找
/*
void main()
{
map<int, string> map1;
map1.insert(pair<int, string>(1, "jack"));
map1.insert(pair<int, string>(2, "rose"));
map1.insert(pair<int, string>(3, "jason"));
printMap(map1);
cout << "---------" << endl;
//获取key等于大于5的元素的值
pair<map<int, string>::iterator, map<int, string>::iterator> p = map1.equal_range(2);
if (p.first != map1.end()){
//等于2的元素key value
cout << p.first->first << p.first->second << endl;
//大于2的元素key value
cout << p.second->first << p.second->second << endl;
}
system("pause");
}
*/
//一个key对应多个value
//一个部门多个员工
//multimap
/*
class Employee
{
public:
Employee(char* name,int age)
{
this->name = name;
this->age = age;
}
public:
char* name;
int age;
};
void main()
{
multimap<string, Employee> map1;
//开发部
map1.insert(make_pair("开发", Employee("搁浅", 20)));
map1.insert(make_pair("开发", Employee("彪哥", 20)));
//财务
map1.insert(make_pair("财务", Employee("小颖", 16)));
map1.insert(make_pair("财务", Employee("rose", 20)));
//销售
map1.insert(make_pair("销售", Employee("阿呆", 30)));
map1.insert(make_pair("销售", Employee("呵呵", 30)));
//遍历输出
for (multimap<string, Employee>::iterator it = map1.begin(); it != map1.end(); it++)
{
cout << it->first << "," << it->second.name << "," << it->second.age << endl;
}
cout << "----------------" << endl;
//只获取“财务”部的员工
//获取“财务部”员工的个数，key对应的value的个数
int num = map1.count("财务");
multimap<string, Employee>::iterator it = map1.find("财务");
int c = 0; //控制循环的次数
while (it != map1.end() && c < num)
{
cout << it->first << "," << it->second.name << "," << it->second.age << endl;
it++;
c++;
}
system("pause");
}
*/
//深拷贝与浅拷贝
/*
class Employee
{
public:
//构造函数
Employee(char* name, int age)
{
this->name = new char[strlen(name) + 1];
strcpy(this->name, name);
this->age = age;
}
//析构函数
~Employee()
{
if (this->name != NULL)
{
delete[] this->name;
this->name = NULL;
this->age = 0;
}
}
//拷贝构造函数
//Employee e =
Employee(const Employee &obj)
{
this->name = new char[strlen(obj.name) + 1];
strcpy(this->name, obj.name);
this->age = obj.age;
}
//重载=
//e1 = e2;
Employee& operator=(const Employee &obj)
{
//释放旧的内存
if (this->name != NULL)
{
delete[] this->name;
this->name = NULL;
this->age = 0;
}
//重新分配
this->name = new char[strlen(obj.name) + 1];
strcpy(this->name, obj.name);
this->age = obj.age;
return *this;
}
public:
char* name;
int age;
};
void func()
{
vector<Employee> v1;
Employee e1("jack",20);
v1.push_back(e1);
}
void main()
{
//vector<Employee> v1;
//Employee e1("jack",20);
//将e1拷贝到vector中
//v1.push_back(e1);
func();
system("pause");
}
*/
08.stl函数2
猜你喜欢
转载自blog.csdn.net/a_thousand_miles/article/details/81108124
今日推荐
周排行