解题思路:
注意事项:
参考代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
void rank(int arr[], int n);
int delete(int brr[], int arr[], int n);
int pd(int tmp, int arr[], int n);
int main()
{
int n = 0;
int arr[1000];
int brr[1000];
int i = 0;
while (1)
{
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
rank(arr, n);
int m = delete(brr, arr, n);
printf("%d\n", m);
for (i = 0; i < m; i++)
printf("%d ", brr[i]);
printf("\n\n");
}
return 0;
}
void rank(int arr[], int n)
{
int i = 0;
int j = 0;
for (i = 0; i < n ; i++)
{
for (j = 0; j < n - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
}
}
}
}
int delete(int brr[], int arr[], int n)
{
int sum = 0;
int i = 0;
for (i = 0; i < n; i++)
{
if (pd(arr[i], arr, i))
{
brr[sum] = arr[i];
sum++;
}
}
return sum;
}
int pd(int tmp, int arr[], int n)
{
int i = 0;
for (i = 0; i < n ; i++)
{
if (tmp == arr[i])
return 0;
}
return 1;
}
0.0分
0 人评分
C语言训练-求s=a+aa+aaa+aaaa+aa...a的值 (C语言代码)浏览:692 |
求圆的面积 (C语言代码)浏览:1670 |
A+B for Input-Output Practice (IV) (C语言代码)浏览:493 |
小O的乘积 (C++代码)浏览:520 |
孤独的骑士 (C语言代码)浏览:1372 |
C语言训练-斐波纳契数列 (C语言代码)浏览:600 |
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:560 |
P1002 (C++代码)浏览:718 |
龟兔赛跑预测 (C++代码)浏览:1183 |
C语言程序设计教程(第三版)课后习题6.6 (C语言代码)浏览:553 |