3325顺序表应用2：多余元素删除之建表算法

#include<iostream>
#include<cstdlib>
#define MAX 101
#define OVERFLOW -1
using namespace std;
typedef struct
{
int *elem;
int listlen;
int listsize;
}list;
list  CreatList (list &l,int n)
{
l.elem=new int [MAX];
if(!l.elem)
exit(OVERFLOW);
l.listlen=0;
l.listsize=MAX;
int  count=0;
while(count<n)
{
int x,i;
cin>>x;
count++;
if(!l.elem)
{
l.elem[0]=x;
l.listlen++;
}
else
{
for(i=0;i<l.listlen;i++)
{
if(l.elem[i]==x)
break;
}
if(i==l.listlen)
{
l.elem[i]=x;
l.listlen++;
}
}
}
return l;
}
int main()
{
int n,t,i;
cin>>t;
while(t--)
{
cin>>n;
list newlist;
CreatList(newlist,n);
for(i=0;i<newlist.listlen;i++)
{
if(i!=newlist.listlen-1)
cout<<newlist.elem[i]<<" ";
else cout<<newlist.elem[i]<<endl;
}
}
return 0;
}