[20-04-28][Self-test 20]Java MaxArrayMin

 1 package test_3_4;
 2 
 3 public class MaxArrayMin {
 4 
 5     public static void main(String[] args) {
 6 
 7         /** 题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。 */
 8         int[] numArray = { 21, 32, 5, 123, 64, 23, 44 };
 9         printNum(numArray);
10         deal(numArray);
11 
12     }
13 
14     /**
15      * 处理数组
16      * 
17      * @param numArray 要处理的数组
18      */
19     private static void deal(int[] numArray) {
20 
21         int min = numArray[0];
22         int max = numArray[0];
23         int minIndex = 0;
24         int maxIndex = 0;
25         
26         for (int i = 1; i < numArray.length; i++) {
27             if (min > numArray[i]) {
28                 min = numArray[i];
29                 minIndex = i;
30             }
31             if (max < numArray[i]) {
32                 max = numArray[i];
33                 maxIndex = i;
34             }
35         }
36         
37         int temp = numArray[0];
38         numArray[0] = numArray[maxIndex];
39         numArray[maxIndex] = temp;
40         
41         temp = numArray[numArray.length - 1];
42         numArray[numArray.length - 1] = numArray[minIndex];
43         numArray[minIndex] = temp;
44         
45         printNum(numArray);
46     }
47 
48     /**
49      * 打印数组
50      * 
51      * @param numArray 要打印的数组
52      */
53     private static void printNum(int[] numArray) {
54 
55         for (int i = 0; i < numArray.length; i++) {
56             System.out.print(numArray[i] + " ");
57         }
58         System.out.println("");
59 
60     }
61 
62 }

结果如下:

21 32 5 123 64 23 44
123 32 44 21 64 23 5

猜你喜欢

转载自www.cnblogs.com/mirai3usi9/p/12798149.html