mirror of
https://github.com/adambard/learnxinyminutes-docs.git
synced 2025-04-27 07:33:57 +00:00
efficient typo fix
This commit is contained in:
parent
0b8fd8ff21
commit
00bb4b8a70
@ -1057,7 +1057,7 @@ cout << ST.size(); // will print the size of set ST
|
|||||||
// Output: 0
|
// Output: 0
|
||||||
|
|
||||||
// NOTE: for duplicate elements we can use multiset
|
// NOTE: for duplicate elements we can use multiset
|
||||||
// NOTE: For hash sets, use unordered_set. They are more effecient but
|
// NOTE: For hash sets, use unordered_set. They are more efficient but
|
||||||
// do not preserve order. unordered_set is available since C++11
|
// do not preserve order. unordered_set is available since C++11
|
||||||
|
|
||||||
// Map
|
// Map
|
||||||
@ -1086,7 +1086,7 @@ cout << it->second;
|
|||||||
|
|
||||||
// Output: 26
|
// Output: 26
|
||||||
|
|
||||||
// NOTE: For hash maps, use unordered_map. They are more effecient but do
|
// NOTE: For hash maps, use unordered_map. They are more efficient but do
|
||||||
// not preserve order. unordered_map is available since C++11.
|
// not preserve order. unordered_map is available since C++11.
|
||||||
|
|
||||||
///////////////////////////////////
|
///////////////////////////////////
|
||||||
|
Loading…
Reference in New Issue
Block a user