map基本概念
简介:
- map中所有元素都是pair
- pair中第一个元素为key值(键值),起到索引作用,第二个值为value(实值)
- 所有元素都会根据元素的键值排序
本质:
关联式容器,二叉树实现
优点:
可以根据key值快速找到value值
map/multimap区别:
map不允许有重复的key值元素
map构造和赋值
#include<iostream>
#include<map>
using namespace std;
void printMap(map<int, int>m)
{
for (map<int, int>::iterator it = m.begin();it != m.end();it++)
{
cout << "Key= " << (*it).first << " value = " << (*it).second << endl;
}
}
void test01()
{
map<int,int>m;
m.insert(pair<int, int>(1, 10));
m.insert(pair<int, int>(2, 20));
m.insert(pair<int, int>(3, 30));
m.insert(pair<int, int>(4, 40));
printMap(m);
map<int, int>m2(m);
printMap(m2);
map<int, int>m3;
m3 = m;
printMap(m3);
}
int main()
{
test01();
system("pause");
return 0;
}
map大小交换
#include<iostream>
#include<map>
using namespace std;
void printMap(map<int, int>m)
{
for (map<int, int>::iterator it = m.begin();it != m.end();it++)
{
cout << "Key= " << (*it).first << " value = " << (*it).second << endl;
}
}
void test01()
{
map<int, int>m;
m.insert(pair<int, int>(1, 10));
m.insert(pair<int, int>(2, 20));
m.insert(pair<int, int>(3, 30));
m.insert(pair<int, int>(4, 40));
printMap(m);
if (m.empty())
{
cout<<"empty!"<<endl;
}
else
{
cout << "not empty" << endl;
cout << m.size() << endl;
}
map<int, int>m2;
m2.insert(pair<int, int>(5, 50));
m2.insert(pair<int, int>(7, 70));
m2.insert(pair<int, int>(8, 80));
m2.insert(pair<int, int>(4, 40));
m.swap(m2);
printMap(m);
}
int main()
{
test01();
system("pause");
return 0;
}
map插入和删除
#include<iostream>
#include<map>
using namespace std;
void printMap(map<int, int>m)
{
for (map<int, int>::iterator it = m.begin();it != m.end();it++)
{
cout << "Key= " << (*it).first << " value = " << (*it).second << endl;
}
}
void test01()
{
map<int, int>m;
m.insert(pair<int, int>(1, 10));
m.insert(pair<int, int>(2, 20));
m.insert(pair<int, int>(3, 30));
m.insert(pair<int, int>(4, 40));
m.insert(make_pair(5, 50));
m.insert(map<int, int>::value_type(6, 60));
m[7] = 70;//不太建议这种
printMap(m);
m.erase(m.begin());
m.erase(3);//按照key删除
printMap(m);
m.clear();
}
int main()
{
test01();
system("pause");
return 0;
}
map查找和排序
#include<iostream>
#include<map>
using namespace std;
void printMap(map<int, int>m)
{
for (map<int, int>::iterator it = m.begin();it != m.end();it++)
{
cout << "Key= " << (*it).first << " value = " << (*it).second << endl;
}
}
void test01()
{
map<int, int>m;
m.insert(pair<int, int>(1, 10));
m.insert(pair<int, int>(2, 20));
m.insert(pair<int, int>(3, 30));
m.insert(pair<int, int>(4, 40));
printMap(m);
map<int, int>::iterator pos = m.find(3);
if (pos != m.end())
{
cout << "查到了元素" << endl;
}
else
{
cout << "mei" << endl;
}
int um = m.count(3);
cout << um << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
map容器排序
#include<iostream>
#include<map>
using namespace std;
class mycompare
{
public:
bool operator()(int v1, int v2) const
{
return v1 > v2;
}
};
void test01()
{
map<int, int,mycompare>m;
m.insert(pair<int, int>(1, 10));
m.insert(pair<int, int>(2, 20));
m.insert(pair<int, int>(3, 30));
m.insert(pair<int, int>(4, 40));
for (map<int, int>::iterator it = m.begin();it != m.end();it++)
{
cout << "Key= " << (*it).first << " value = " << (*it).second << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}