Introduction
Set is a data structure that only stores unique elements
Initialize
CODE
#include <set>
using namespace std;
int main(){
set<int> iSet;
set<string> sSet;
iSet.insert(10);
}
Check for an element
CODE
if (iSet.find(20) != iSet.end()) {
cout << "20 is in the set" << endl;
}
Erase an element
CODE
iSet.erase(20);
Iterate over an element
CODE
for (auto it = iSet.begin(); it != iSet.end(); ++it) {
std::cout << *it << " ";
}
Get the size
CODE
std::cout << "Size: " << iSet.size() << std::endl;
Clear the set
CODE
iSet.clear();
Application
- Removing duplicates in an array
- Set Operations
Vollständiger Original-Bericht
Ausführliche Details, Code-Beispiele & Hersteller-Stellungnahme auf dev.to.
SOCIAL SHARE CARD GENERATOR