C++数组元素去重

#include<iostream>
#include<vector>
using namespace std;
void sort(int arr[]); //排序
void show(int arr[]);  //展示
void except(int arr[]);//去重
#define N 34

 //排序
void sort(int arr[])
{
	
	for (size_t i = 0; i < N - 1; i++)
	{
		for (size_t j = 0; j < N - i; j++)
		{

			if (arr[j] < arr[j + 1])
			{
				int temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;


			}

		}


	}
}
//展示
void show(int arr[])
{
	for (int i = 0; i < N; i++)
	{
		cout << arr[i];

	}
	cout << endl;
}
 //去重
void except(int arr[])
{
	sort(arr);
	show(arr);
	size_t count = 0;
	for (size_t i = 0; i < N; i++)	  //检测重复的个数
	{
		
		int temp = arr[i];
		int j = i + 1;
		while (arr[j]==temp)
		{
			count++;
			j++;
		}
		i = j - 1;

	}  //end for

	//将去重后的数据装入容器中
	vector<int> vec;
	for (size_t i = 0; i < N; i++)
	{
		int j = i - 1;
		if (j >= 0 && arr[j] != arr[i])
		{
			vec.push_back(arr[j]);
			
			
		}
		if (i==N-1&&arr[N-1]!=arr[N-2])
		{
			vec.push_back(arr[N-1]);
		}
		
		
		
	}

	for (auto v:vec)
	{
		cout << v;

	}
	cout << endl;
	
	
}

int main(int argc, char *argv[])
{
		
	int arr[N] = { 0,1,1,2,2,2,3,3,3,4,4,4,4,5,5,6,6,6,6,7,8,9,8,9,7,4,5,6,6,5,1,2,3,4 };
	except(arr);
	system("pause");
	return 0;
	
}