对一个数组的数进行 去重


int n = 11;
	int a[] = {1, 1, 2, 3 ,3, 4, 4, 5, 5, 5, 5};
	n = unique(a, a + n) - a;//使用STL自带去重函数,返回值为最后一个元素的位置(地址)
	for (int i = 0; i < n; i ++) {
		cout << a[i] << " ";
	}




int n = 11;
	int a[] = {1, 1, 2, 3 ,3, 4, 4, 5, 5, 5, 5};
	n = unique(a, n);
	for (int i = 0; i < n; i ++) {
		cout << a[i] << " ";
	}



猜你喜欢

转载自blog.csdn.net/chuanyu/article/details/53131347