forked from AlEinstein/javaCode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExchangeOfNumber
More file actions
59 lines (47 loc) · 1.3 KB
/
Copy pathExchangeOfNumber
File metadata and controls
59 lines (47 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
/**
* 输入十个整数,最小的数与第一个数对换,最大的数与最后一个数对换
* @param args
*/
public static void main(String[] args) {
/*输入十个数*/
Scanner input = new Scanner(System.in);
List<Integer> list = codeInput(input);
/*进行处理*/
codeProcessing(list);
/*输出十个数*/
codeOutput(input, list);
}
public static List<Integer> codeInput(Scanner input) { // 输入十个数
List<Integer> list = new ArrayList<>();
for (int i = 0; i < 10; i++) {
list.add(input.nextInt());
}
return list;
}
public static void codeProcessing(List<Integer> list) { // 进行处理
int max = list.get(0);
int min = list.get(0);
for (int i = 1; i < 9; i++) {
max = max > list.get(i) ? max : list.get(i);
min = min < list.get(i) ? min : list.get(i);
}
int indexMax = list.indexOf(max);
int indexMin = list.indexOf(min);
int temp = list.get(9);
list.set(9, max);
list.set(indexMax, temp);
temp = list.get(0);
list.set(0, min);
list.set(indexMin, temp);
}
public static void codeOutput(Scanner input, List<Integer> list) { // 输出十个数
for (int i : list) {
System.out.print(i + " ");
}
input.close();
}
}