题解 | #明明的随机数#
明明的随机数
http://www.nowcoder.com/practice/3245215fffb84b7b81285493eae92ff0
{
int newlen = len;
int i = 0, j = 0;
for (i = 0; i < len; i++)
{
int flag = s[i];
for (j = i+1; j < newlen; j++)
{
if (flag == s[j])
{
int tem = j + 1;
while (tem < newlen)
{
s[tem - 1] = s[tem];
tem++;
}
newlen--;
j--;
}
}
}
return newlen;
}
int com(const int*a,const int *b)
{
return *a - *b;
}
int main()
{
int N = 0;
scanf("%d", &N);
int i = 0;
int in[1000] = { 0 };
while (i <N)
{
scanf("%d", &in[i++]);
}
int l=dele(in, N);
qsort(in, l,4,com);
i = 0;
while (i <l)
printf("%d\n", in[i++]);
return 0;
}