首先排序:nlong(n)
int a[] = {1,2,3,3,4,0};
int i=0, j=1;
while(a[i])
{
if(a[i]!=a[j])
a[++i] = a[j];
j++;
}
时间复杂度为O(nlogn);
首先排序:nlong(n)
int a[] = {1,2,3,3,4,0};
int i=0, j=1;
while(a[i])
{
if(a[i]!=a[j])
a[++i] = a[j];
j++;
}
时间复杂度为O(nlogn);