算法1
unordered_map
C++ 代码
include[HTML_REMOVED]
using namespace std;
int const N=50005;
int main()
{
int t;
cin>>t;
int n;
int x;
while(t–)
{
unordered_map[HTML_REMOVED] a;
cin>>n;
for(int i=1;i<=n;i)
{
cin>>x;
a[x];
if(a[x]==1)
{
cout<<x<<” “;
}
}
cout<<endl;
}
return 0;
}