描述:
std::unique与erase联合使用,移除容器范围内的连续重复元素。
当容器先排好序后,再使用std::unique与erase,移除容器范围内的重复元素。
定义:
template< class ForwardIt >
ForwardIt unique( ForwardIt first, ForwardIt last );
template< class ForwardIt >
constexpr ForwardIt unique( ForwardIt first, ForwardIt last );
template< class ForwardIt, class BinaryPredicate >
ForwardIt unique( ForwardIt first, ForwardIt last, BinaryPredicate p );
template< class ForwardIt, class BinaryPredicate >
constexpr ForwardIt unique( ForwardIt first, ForwardIt last, BinaryPredicate p );
可能的实现:
template<class ForwardIt>
ForwardIt unique(ForwardIt first, ForwardIt last)
{
if (first == last)
return last;
ForwardIt result = first;
while (++first != last) {
if (!(*result == *first) && ++result != first) {
*result = std::move(*first);
}
}
return ++result;
}
template<class ForwardIt, class BinaryPredicate>
ForwardIt unique(ForwardIt first, ForwardIt last, BinaryPredicate p)
{
if (first == last)
return last;
ForwardIt result = first;
while (++first != last) {
if (!p(*result, *first) && ++result != first) {
*result = std::move(*first);
}
}
return ++result;
}
参数:
first, last - 要处理的元素范围
p - 若元素应被当做相等则返回 true 的二元谓词。
返回值:
返回范围新结尾的向前迭代器。
示例:
#include <iostream>
#include <string>
#include <algorithm>
int main()
{
std::string s1 = "1211333454";
auto iter = std::unique(s1.begin(), s1.end());
s1.erase(iter, s1.end());
for (int i = 0; i < s1.size(); i++)
std::cout << s1[i] << " ";
std::cout << std::endl;
//1 2 1 3 4 5 4
return 0;
}
#include <iostream>
#include <algorithm>
#include <vector>
struct SData
{
int m_nData;
double m_dData;
SData(int nData, double dData)
:m_nData(nData),m_dData(dData)
{
}
};
int main()
{
std::vector<SData> v;
for (int i = 0; i < 5; i++)
{
SData data(i,i);
v.push_back(data);
v.push_back(data);
}
//使用lambda表达式指定条件(一般用于自定义元素)
auto iter = std::unique(v.begin(), v.end(), [](const SData& data1,const SData& data2)
{
return data1.m_nData == data2.m_nData;
});
v.erase(iter, v.end());
for (int i = 0; i < v.size(); i++)
std::cout << v[i].m_nData << " ";
std::cout << std::endl;
//0 1 2 3 4
return 0;
}