自定义函数进行无序向量唯一化

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
//自定义find函数
int find(vector<int>&a, int &b, int lo, int hi)
{
	while ((lo < hi--) && b != a[hi]);//从后向前依次比较
	return hi;
}
//自定义 remove函数
int remove(vector<int>&a,int lo, int hi)
{
	int oldsize = a.size();
	if (lo == hi) return 0;
	while (hi < oldsize)
	{
		a[lo++] = a[hi++];//等于a[lo]=a[hi],lo++.hi++
	}
	int size;
	size = lo;
	return size;
}
//唯一化函数
void unequal(vector<int>&a)
{
	int oldsize = a.size();
	for (int i = 1; i < oldsize; )
	{
		if (find(a, a[i], 0, i) >0)
		{
			remove(a, i, i + 1);
			oldsize--;
			//注意oldsize会改变，remove之后又oldsize会-1
		}
		else
			i++;
	}
	for (int i = 0; i <oldsize; i++)
		cout <<a[i];

}
int main()
{
	int a[] = { 4,5,5,7,2,2,7,0,8,4,9 };
	vector<int>vc;
	for (int i = 0; i < sizeof(a)/sizeof(int); i++)
	{
		vc.push_back(a[i]);
	}
	unequal(vc);
	
	system("pause");
	return 0;

}

其中remove函数的算法思想为——要删掉哪个数，就把他后面的所有数都向前移一位。

有序向量唯一化

#include <iostream>
#include<vector>
using namespace std;
int niquify(vector<int>&element, int _size)
{
	int i = 0, j = 0;
	while (++j<_size)
	{
		if (element[i] != element[j])//从秩为1的元素开始，发现不同的元素
		{
			element[++i] = element[j];
		}
	}
	_size = ++i;
	cout << "vector's size" << _size << endl;
	element.resize(_size);
	return i;
}

int main()
{
	vector<int> a;
	a.push_back(1);
	a.push_back(1);
	a.push_back(1);
	a.push_back(2);
	a.push_back(2);
	a.push_back(2);
	a.push_back(3);
	a.push_back(3);
	a.push_back(4);
	a.push_back(4);
	a.push_back(4);
	int newize=niquify(a, a.size());
	for (int i = 0; i <  newize; i++)
	{
		cout << a[i] << endl;
	}
	system("pause");
	return 0;
}