解题思路:
注意事项:
参考代码:
import java.util.Scanner;
public class p45 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[10];
int max = 0;
int min = 0;
for (int i = 0; i < a.length; i++) {
a[i] = sc.nextInt();
max = a[0];
min = a[0];
}
int x = 0;
for (int i = 0; i < a.length; i++) {
if (max < a[i]) {
max = a[i];
x = i;
}
if (i == a.length - 1) {
int t = max;
a[x] = a[9];
a[9] = t;
}
}
int n = 0;
for (int i = 0; i < a.length; i++) {
if (min > a[i]) {
min = a[i];
n = i;
}
if (i == a.length - 1) {
int t = min;
a[n] = a[0];
a[0] = t;
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
}
0.0分
0 人评分
【亲和数】 (C语言代码)浏览:559 |
简单的a+b (C语言代码)浏览:612 |
简单的a+b (C语言代码)浏览:515 |
1052题解(链表操作)浏览:720 |
P1044 (C++代码)浏览:513 |
DNA (Java代码)浏览:955 |
母牛的故事 (C语言代码)浏览:505 |
Manchester- A+B for Input-Output Practice (I)浏览:1827 |
Hello, world! (C语言代码)浏览:750 |
母牛生小牛 (C语言代码)浏览:1770 |