Removing duplicate elements from std::vector (using std::unique and std::set)














































Removing duplicate elements from std::vector (using std::unique and std::set)



Description:
    In this article we shall understand various methods of removing duplicate values from a std::vector.
Example:

Input: 10
             9  8  10 8  11  6  9  4  11  6

    The first line of input is number of array elements n, and the next line consist of n array elements ai.
Output:  
  •           4  6  8  9  10  11
  •  The output consist of all the unique elements of the vector in sorted order.

Method 1: (using std: :unique())
    In this method we shall use the unique() method of standard library of C++. The unique(iterator 1, iterator 2)
function takes two iterators as parameter and shifts the duplicate element present adjacently to each other
at the end of the vector. Please note that unique() will only work on a sorted vector (because sorted list
will have same elements adjacent to each other). The unique() returns the last position of the vector till where
it has no duplicate elements. We can then resize the vector to the returned iterator of unique().
Program:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> A(n);
for(int i = 0; i < n; i++)
        cin >> A[i];

    sort(A.begin(), A.end()); // Sorting the entire array
    auto iter = unique(A.begin(), A.end()); // returns an iterator to the element that follows the last element not removed
    A.resize(distance(A.begin(), iter)); // distance returns number of elements between two iterator
   
for(int i = 0; i < A.size(); i++)
        cout << A[i] << " ";

}

Complexity:
Time Complexity: The above program will take O(n logn) time complexity for sorting because sort() function in C++ is implemented using quick-sort which has average time complexity of O(n logn).
Space Complexity: The space complexity for the above program is O(n) for storing array elements.


Method 2: (using std: :set)
    In this method is pretty straight-forward. We shall iterate over all the elements of the vector and store them in
std::set data-structure. As we know set data-structure is implemented using red-black tree so it prevents
storing of duplicate values.
Program:
#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main()
{
    int n;
    cin >> n;
vector<int> A(n);
for(int i = 0; i < n; i++)
        cin >> A[i];
   
    set<int> S;
    for(int i = 0; i < n; i++)
        S.insert(A[i]);

    for(auto it = S.begin(); it != S.end(); it++)
        cout << *it << " ";
}

Complexity:
Time Complexity: The above program will take O(n logn) time complexity because insert operation in set takes O(log n) time and hence n elements take O(nlog n) time.
Space Complexity: The above program takes O(n) extra space for storing elements in set as well as vector when all elements of the vector are already unique.

Please write on comment section if you find any mistake or for any suggestions.

More Articles of Abhishek Kumar Singh:

Name Views Likes
C++ boost::range::replace_if 1020 0
C++ boost::range::copy_backward 759 1
C++ boost::range::max_element 1234 0
C++ boost::range::inplace_merge 686 0
C++ boost::range::copy 1351 1
C++ boost::algorithm::is_partitioned() 857 1
C++ boost::algorithm::copy_if() 1048 0
C++ boost::range::for_each (version 2) 768 0
C++ boost::range::set_symmetric_difference 684 0
C++ boost::remove_copy_if 769 0
C++ boost::range::set_intersection 1028 0
C++ boost::range::find_end 707 0
C++ boost::range::remove_erase_if 1652 0
C++ boost::range::push_back 1174 0
C++ boost::range::generate 672 0
C++ boost::algorithm::any_of() 739 0
C++ boost::range::insert 737 0
C++ boost::range::remove_erase 948 0
C++ boost::range::reverse 1266 0
C++ boost::algorithm::equal() 775 1
C++ boost::range::copy_n 848 0
C++ boost::range::random_shuffle 1286 1
C++ boost::algorithm::partition_point() 653 0
C++ boost::algorithm::one_of_equal() 545 0
C++ boost::algorithm::all_of() 918 1
C++ boost::range::merge 1059 0
C++ boost::range::reverse_copy 773 0
C++ boost::range::find 781 0
C++ boost::range::fill_n 627 0
Removing duplicate elements from std::vector (using std::unique and std::set) 2477 1
C++ boost::range::equal 739 0
C++ boost::algorithm::iota() 1015 0
C++ boost::range::is_sorted 852 0
test article 800 2
C++ boost::algorithm::is_permutation() 883 1
C++ boost::partial_sum 893 0
C++ boost::range::partial_sort 948 1
C++ boost::range::min_element 1085 0
C++ boost::range::iota 1084 0
C++ boost::range::set_union 736 0
C++ boost::algorithm::partition_copy() 1093 3
C++ boost::range::swap_ranges 634 0
C++ boost::range::for_each 920 0
C++ boost::range::upper_bound 1091 0
C++ boost::range::binary_search 1249 0
C++ boost::algorithm::all_of_equal() 569 0
C++ boost::algorithm::copy_n() 707 1
C++ boost::range::lower_bound 1048 0
C++ boost::algorithm::gather() 1534 0
C++ boost::algorithm::none_of_equal() 612 0
C++ boost::algorithm::one_of() 726 2
C++ boost::range::rotate 877 0
C++ boost::algorithm::any_of_equal() 881 0
Use of Comparator in C++ 2130 0
C++ boost::range::count 828 0
C++ boost::range::replace_copy_if 649 0
C++ boost::range::remove 841 2
C++ boost::remove_if 1463 1
C++ boost::range::nth_element 1155 1
C++ boost::range::partition 759 1
C++ boost::range::erase 672 0
C++ boost::range::fill 908 1
C++ boost::range::find_if 1364 0
C++ boost::range::lexicographical_compare 817 0
C++ boost::algorithm::none_of() 600 0
C++ boost::algorithm::hex() 3753 0
C++ boost::range::replace 751 0
C++ boost::range::replace_copy 825 1
C++ boost::range::set_difference 980 0
C++ boost::range::overwrite 729 0
C++ boost::range::count_if 982 0
C++ boost::range::push_front 674 0
C++ boost::range::includes 670 0
C++ boost::algorithm::is_sorted() 713 0
C++ boost::range::remove_copy 633 1
C++ boost::algorithm::minmax_element 632 1
Deletion of leaf node of a Binary Search Tree 1728 1
Nth Fibonacci Number (Recursive Solution, Dynamic Programming, Iterative Solution 3928 1
C++ boost::range::rotate_copy 664 0

Comments