How do I remove duplicates with std::deque?

In C++, you can remove duplicates from a `std::deque` by using the `std::unique` algorithm along with the `erase` method. Here’s a simple example demonstrating how to achieve this.


        #include <iostream>
        #include <deque>
        #include <algorithm>
        
        int main() {
            std::deque d = {1, 2, 2, 3, 4, 4, 5};
            
            // Sort the deque if the order of elements is not guaranteed
            std::sort(d.begin(), d.end());
            
            // Remove duplicates
            auto last = std::unique(d.begin(), d.end());
            d.erase(last, d.end());
            
            // Displaying the results
            std::cout << "Deque after removing duplicates: ";
            for (const auto &num : d) {
                std::cout << num << " ";
            }
            std::cout << std::endl;
            
            return 0;
        }

C++ std::deque remove duplicates std::unique algorithm collection programming

How do I remove duplicates with std::deque?

Popular Topics

Recent Languages

How do I remove duplicates with std::deque?

Related Questions

Popular Topics

Recent Languages