How to make a vector with unique elements erasing duplicate entires in C++?

Блог пользователя gaurab_sust

Автор gaurab_sust, 13 лет назад, По-английски

Suppose the vector is vec then , vec.sort(vec.begin(),vec.end()); vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())));

troubleshooting, c++

-5

gaurab_sust
13 лет назад
6

Комментарии (5)

Показать архивные | Написать комментарий?

JuanMata

13 лет назад, скрыть # |

i don't know if this will solve ur problem, but maybe u can try using std::set instead of std::vector.

→ Ответить

ifsmirnov

13 лет назад, скрыть # |

← Rev. 2 →

+19

And what's wrong with your solution? I usually use one of these two snippets:

sort(a.begin(), a.end());
a.resize(a.end() - unique(a.begin(), a.end));

sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());

→ Ответить

Zlobober

13 лет назад, скрыть # ^ |

+37

Isn't your first snippet wrong?

a.resize(unique(a.begin(), a.end()) - a.begin());

It should be something like this (you've also missed brackets after end).

→ Ответить

lungi_vai

4 года назад, скрыть # ^ |

why we subtract a.begin() ?

→ Ответить

Irval

4 года назад, скрыть # ^ |

This function removes all but the first element from every consecutive group of equivalent elements in the range [first,last). It returns an iterator to the element that follows the last element not removed. The range between first and this iterator includes all the elements in the sequence that were not considered duplicates.

→ Ответить