When working with `std::array` in C++, you may encounter situations where you need to remove duplicate elements. Here’s how you can do this effectively using standard algorithms.
#include <iostream>
#include <array>
#include <algorithm>
int main() {
std::array arr = {1, 2, 3, 2, 4, 5, 5, 1, 6, 7};
// Sort the array
std::sort(arr.begin(), arr.end());
// Remove duplicates
auto last = std::unique(arr.begin(), arr.end());
// Resize the array to remove duplicates
arr.resize(std::distance(arr.begin(), last));
// Print the result
std::cout << "Array after removing duplicates: ";
for(auto a : arr) {
std::cout << a << " ";
}
std::cout << std::endl;
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?