Becausemapcontainers do not allow for duplicate keys, this means that the function actually returns 1 if an element with that key is found, and zero otherwise.
// map::count
#include <iostream>
#include <map>
using namespace std;
int main ()
{
map<char,int> mymap;
char c;
mymap ['a']=101;
mymap ['c']=202;
mymap ['f']=303;
for (c='a'; c<'h'; c++)
{
cout << c;
if (mymap.count(c)>0)
cout << " is an element of mymap.\n";
else
cout << " is not an element of mymap.\n";
}
return 0;
}
原文链接: https://www.cnblogs.com/zxfx100/archive/2011/10/13/2210904.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/34220
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!