该博客介绍了三种方法来找出系统随机生成的n个数中的第二大的数值。第一种方法通过比较每次生成的随机数与当前最大值更新最大值和次大值。第二种方法同样利用比较更新次大值，但在找到新的次大值时会调整最大值。第三种方法通过排序整个数列然后返回倒数第二个元素作为第二大的数值。
int max1 = 0, max2 = 0;
int n = 0;
printf("Enter n : ");
scanf("%d", &n);
for (int i = 0; i < n; i++){
unsigned int random = arc4random();
printf("%u\n", random);
if (random > max1){
max2 = max1;
max1 = random;
}
if (random <= max1 && random >= max2){
max2 = random;
}
}
printf("第二大值为%u\n", max2);
int max1 = 0, max2 = 0;
int n = 0;
printf("enter n :");
scanf("%d", &n);
for (int i = 0; i < n; i++) {
unsigned int random = arc4random();
printf("%u\n", random);
if(max2 < random){
max2 = random;
if (max1 < max2){
int temp = 0;
temp = max2;
max2 = max1;
max1 = temp;
}
}
}
printf("第二大值为%u\n", max2);
int n = 0;
printf("enter geshu n : ");
scanf("%d", &n);
unsigned int array[10000] = {0};
for (int i = 0; i < n; i++) {
unsigned int random = arc4random();
array[i] = random;
printf("array[%d] = %u\n", i, random);
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (array[j] > array[j + 1]) {
unsigned int temp = 0;
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
printf("%u\n", array[n - 2]);
for (int i = 0; i < n; i++){
printf("[%2d] : %u\n", i, array[i]);
}
扫一扫
1760
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
