Write a function named removeDuplicates
that accepts as a parameter a reference to a vector
of integers, and modifies it by removing any duplicates.
Note that the elements of the vector are not in any particular order, so the duplicates might not occur consecutively.
You should retain the original relative order of the elements.
Use a set
as auxiliary storage to help you solve this problem.
For example, if a vector named v
stores {4, 0, 2, 9, 4, 7, 2, 0, 0, 9, 6, 6}
, the call of removeDuplicates(v);
should modify it to store {4, 0, 2, 9, 7, 6}
.