华为oj 003

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_25244495/article/details/81773187

 

【003-明明的随机数】

https://blog.csdn.net/DERRANTCM/article/details/51231923

C++实现：

void main()
{
	int n;
	cin>>n;

	int n1;
	int nums[1001] = {0};
	for (int i=0;i<n;i++)
	{
		cin>>n1;
		nums[n1] = 1;
	}

	for (int i=0;i<1001;i++)
	{
		if(nums[i] ==1)
			cout<<i<<endl;
	}
	system("pause");
}

方法2：

void main()
{
	int n;
	cin>>n;

	int n1;
	vector<int> nList;
	for (int i=0;i<n;i++)
	{
		cin>>n1;
		nList.push_back(n1);
	}

	sort(nList.begin(),nList.end());
	vector<int>::iterator v1 = unique(nList.begin(),nList.end());
	nList.erase(v1,nList.end());

	for (int i=0;i<nList.size();i++)
	{
			cout<<nList[i]<<endl;
	}

	system("pause");

}