解题思路:
注意事项:
参考代码:
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
List<Integer> list = new ArrayList<>();
Scanner in = new Scanner(System.in);
for (int a = 0; a < 10; a++) {
list.add(in.nextInt());
}
int m = list.get(0);
int locate = 0;
//找到最小值
for(int a = 1;a < 10;a ++){
if(m>list.get(a)){
m=list.get(a);
locate=a;
}
}
//交换
int tem;
tem = list.get(0);
list.set(0, m);
list.set(locate, tem);
//找到最大值
m = list.get(0);
locate = 0;
for(int a = 1;a < 10;a ++){
if(m<list.get(a)){
m=list.get(a);
locate=a;
}
}
tem = list.get(9);
list.set(9, m);
list.set(locate, tem);
for(int a = 0;a < 10;a ++){
System.out.print(list.get(a)+" ");
}
}
}
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题7.3 (C语言代码)浏览:1190 |
C语言程序设计教程(第三版)课后习题8.5 (C语言代码)浏览:930 |
完数 (C语言代码)浏览:682 |
理财计划 (C语言代码)浏览:463 |
A+B for Input-Output Practice (I) (C语言代码)浏览:425 |
C语言程序设计教程(第三版)课后习题10.1 (C++代码)浏览:497 |
C语言程序设计教程(第三版)课后习题8.7 (C语言代码)浏览:526 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:680 |
WU-玉龙学长买雪糕 (C++代码)浏览:1091 |
Manchester- 求之N内的素数浏览:1492 |