题解 | #序列中整数去重#

//BC125 序列中整数去重 
#include<stdio.h>
void Input_arr(int arr[], int n)
{
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]); 
	}
}

void Jud_arr(int arr[], int n)
{
	int flag = 0; 
	for (int i = 0; i < n; i++)
	{
		for (int j = i+1; j < n; j++)
		{
			if (arr[i] == arr[j])
			{
				arr[j] = -1;
			}
		}
	}
}

void Print(int arr[], int n)
{
	for (int i = 0; i < n; i++)
	{
		if (arr[i] != -1) 
		{
			printf("%d ", arr[i]);  
		} 
	}
}

int main()
{
	int n = 0; 
	int arr[1500] = { 0 }; 
	scanf("%d", &n);
	Input_arr(arr, n); 
	Jud_arr(arr, n); 
	Print(arr, n); 
	return 0; 
}