20.8.1 vector unordered_map bitset

1.vector

//初始化
vector<int> v={1,2,3};

//在末尾插入
v.push_back(4);

2.unordered_map

//初始化
unordered_map<int,int> um;

//插入值
um.insert({1,2});

//查找是否有key
if(um.find(1)!=um.end())
	cout << "Found" << '\n';
if(um.count(1)>0)
	cout << "Found" << '\n';

3.bitset

//初始化
bitset<10> bs;

//翻转值 (true-false)
bs.flip(index);

//统计值为true的数量
bs.count();