mapMystery

This site requires JavaScript. It looks like you have disabled JavaScript in your browser or are using a browser that does not support JavaScript. Please enable it or try another browser.

< collectionMystery5

reverse >

Main Page → Exercises → Small Problems 2B → C++ → Solve an Exercise

You are working on problem set: Small Problems 2B ( Pause)

Language/Type: C++ map collections STL

What is the output of the following code? Assume that a map displays in {key:value, key:value, ..., key:value} format.

map<string, string> map;
map["K"] = "Schwarz";
map["C"] = "Lee";
map["M"] = "Sahami";
map["M"] = "Stepp";
map.erase("Stepp");
map.erase("K");
map["J"] = "Cain";
map.erase("C, Lee");
cout << map << endl;

`output`
`{"C":"Lee", "J":"Cain", "M":"Stepp", "M":"Sahami"}` `{"C":"Lee", "J":"Cain", "M":"Stepp"}` `{"J":"Cain", "M":"Sahami"}` `{"J":"Cain", "C":"Lee", "M":"Sahami", "M":"Stepp"}` (order shuffled)

You must log in before you can solve this problem.

Need help?

Is there a problem? Contact us.

CodeStepByStep

Ad Blocker Detected

mapMystery