#include <map> #include <iostream> using namespace std; int main() { map<int, string> m; m[3] = "C"; m[1] = "A"; m[2] = "B"; // 遍历输出 cout << "map contents:\n"; for (auto it : m) { cout << it.first << ": " << it.
int main(){ std::unordered_set<int> example = {1, 2, 3, 4}; auto search = example.find(2); if (search != example.end()) { std::cout << "Found " << (*search) << '\n'; } else { std::cout << "Not found\n"; } } /*output: 2 */ size(), empty() unordered_set...
1//C++ program to illustrate the2//unordered_set::equal_range function3#include <iostream>4#include <unordered_set>5usingnamespacestd;6intmain() {7//declaration8unordered_set<int>sample;910//Insert some values11sample.insert({20,30,40});1213//Test the equal_range function14//for a given...
std::unordered_set<int> my_set; 向unordered_set中添加元素: 代码语言:cpp 复制 my_set.insert(10); my_set.insert(20); my_set.insert(30); 查找元素: 代码语言:cpp 复制 if (my_set.find(20) != my_set.end()) { std::cout << "Element 20 found in the set."<< std::endl; } else...
end()) { // *it += 1; cout << *it << " "; ++it; } cout << endl; } void test_set() { unordered_set<int> s; int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14, 3,3,15 }; for (auto e : a) { s.insert(e); } for (auto e : s) { cout << e << ...
unordered_set<int>::iterator it = set1.begin(); //返回指向set1首元素的迭代器 unordered_set<int>::const_iterator c_it = set1.cbegin(); //返回指向set1首元素的常量迭代器 unordered_set<int>::local_iterator it = set1.begin(1);//返回1号桶中的首元素迭代器 unordered_set<int>::const_...
MULTI_SET.insert(a[i]); UNORDERED_SET.insert(a[i]); UNORDERED_MULTISET.insert(a[i]); } printf("\n"); printf("GREATER_SET:\n"); for(set<int,greater<int>>::iteratorit=GREATER_SET.begin(); it!=GREATER_SET.end();it++)
#include <iostream>#include <unordered_set>int main() {std::unordered_set<int> mySet;// 检查集合是否为空if (mySet.empty()) {std::cout << "集合为空" << std::endl;} else {std::cout << "集合不为空" << std::endl;}// 添加元素到集合mySet.insert(1);mySet.insert(2);mySet....
#include<unordered_set>#include<iostream>typedefstd::unordered_set<char> Myset;intmain(){ Myset c1; c1.insert('a'); c1.insert('b'); c1.insert('c');// display contents " [c] [b] [a]"for(Myset::const_iterator it = c1.begin(); it != c1.end(); ++it)std::cout<<" ...
#include <iostream> #include <unordered_set> #include <unordered_map> // unordered 是无序的 set默认是有序的 using namespace std; int main() { unordered_set<int> a; //哈希表 不储存重复元素 unordered_multiset<int> b; // 哈希表 可以储存重复元素 unordered_map<int, int> c; } ...