In C++, you can remove duplicates from a std::vector by using the `std::sort` and `std::unique` algorithms. This approach effectively combines sorting the elements and then removing consecutive duplicate entries.
Here’s an example:
#include
#include
#include
int main() {
std::vector vec = {1, 2, 3, 2, 1, 4, 5};
// Sort the vector
std::sort(vec.begin(), vec.end());
// Remove duplicates
auto last = std::unique(vec.begin(), vec.end());
vec.erase(last, vec.end());
// Output the results
for (int n : vec) {
std::cout << n << " ";
}
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?