How can I find unique elements in a C++ vector?

How can I find unique elements in a C++ vector?

You can use the std::unique algorithm along with std::sort to find unique elements in a vector.

Can you show me a code example?

Sure! Here's a simple example:

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    std::vector<int> vec = {1, 2, 2, 3, 4, 4, 5};
    std::sort(vec.begin(), vec.end());
    auto last = std::unique(vec.begin(), vec.end());
    vec.erase(last, vec.end());
    for (int n : vec) {
        std::cout << n << ' ';
    }
    return 0;
}

What does std::unique actually do?

std::unique rearranges the elements in the range to remove consecutive duplicates and returns an iterator to the new end of the range.

Are there other ways to find unique elements?

Yes, you can also use std::set or std::unordered_set to automatically handle uniqueness.