稍等一下，网络有点问题。。。

哦  自己再改改吧 哎

哥们;能写的清楚点吗?看的都快晕了

1. /*
   
2. 数组的最值
   
3. */
   
4. class Demo_Array1 {
   
5. public static void main(String[] args) {
   
6. int[] arr = {12,45,36,78,52,14,12};
   
7. int max = getArrayMax(arr);
   
8. System.out.println("数组最大值为"+max);
   
9. int min = getArrayMin(arr);
   
10. System.out.println("数组最小值为"+min);
    
11. }
    
12. public static int getArrayMax(int[] arr ) {
    
13. int max = arr[0];
    
14. for (int x = 1; x < arr.length; x++) {
    
15. if (max < arr[x]) {
    
16. max = arr[x];
    
17. }
    
18. }
    
19. return max;
    
20. }
    
21. public static int getArrayMin(int[] arr ) {
    
22. int min = arr[0];
    
23. for (int x = 1; x < arr.length; x++) {
    
24. if (min > arr[x]) {
    
25. min = arr[x];
    
26. }
    
27. }
    
28. return min;
    
29. }
    
30. }
    
31. /*
    
32. 逆序
    
33. */
    
34. class Demo_Array2 {
    
35. public static void main(String[] args) {
    
36. int[] arr = {12,45,36,78,52,14,13};
    
37. System.out.println("逆序前：");
    
38. print(arr);
    
39. reverseArray(arr);
    
40. System.out.println("逆序后：");
    
41. print(arr);
    
42. }
    
43. public static void reverseArray(int[] arr) {
    
44. for (int i = 0;i < arr.length/2 ;i++ ) {
    
45. int temp = arr[i];
    
46. arr[i] = arr[arr.length-1-i];
    
47. arr[arr.length-1-i]=temp;
    
48. }
    
49. }
    
50. public static void print(int[] arr ) {
    
51. System.out.print("[");
    
52. for(int i =0;i < arr.length;i++){
    
53. if(i!=arr.length-1) {
    
54. System.out.print(arr[i]+",");
    
55. }else {
    
56. System.out.println(arr[i]+"]");
    
57. }
    
58. }
    
59. }
    
60. }
    
61. /*
    
62. 查表法
    
63. */
    
64. import java.util.Scanner;
    
65. class Demo_Array3{
    
66. public static void main(String[] args) {
    
67. Scanner sc = new Scanner(System.in);
    
68. System.out.println("请输入1~7的整数");
    
69. int x = sc.nextInt();
    
70. if (x < 1 || x > 7) {
    
71. System.out.println("我叶良辰不是你惹得起的人，你敢糊弄我?");
    
72. }else {
    
73. char week = getWeek(x);
    
74. System.out.println(x+"是星期"+week);
    
75. }
    
76. }
    
77. public static char getWeek(int x) {
    
78. char[] arr = {' ','一','二','三','四','五','六','日'};
    
79. 
    
80. return arr[x];
    
81. }
    
82. }
    
83. 
    
84. /*
    
85. 数组元素查找
    
86. */
    
87. import java.util.Scanner;
    
88. class Demo_Array4 {
    
89. public static void main(String[] args) {
    
90. int[] arr = {12,45,36,78,52,14,13};
    
91. print(arr);
    
92. Scanner sc = new Scanner(System.in);
    
93. System.out.println("请输入要查找的数组元素");
    
94. int x = sc.nextInt();
    
95. int index = getIndex(arr,x);
    
96. System.out.println(x+"的角标为"+index);
    
97. }
    
98. public static void print(int[] arr ) {
    
99. System.out.print("[");
    
100. for(int i =0;i < arr.length;i++){
     
101. if(i!=arr.length-1) {
     
102. System.out.print(arr[i]+",");
     
103. }else {
     
104. System.out.println(arr[i]+"]");
     
105. }
     
106. }
     
107. }
     
108. public static int getIndex(int[] arr, int x) {
     
109. for (int i = 0;i < arr.length ;i++ ) {
     
110. if (x == arr[i]) {
     
111. return i;
     
112. }
     
113. }
     
114. return -1;
     
115. }
     
116. 
     
117. }
     
118. /*
     
119. 冒泡排序
     
120. */
     
121. class ArrayBubble {
     
122. public static void main(String[] args) {
     
123. int[] arr = new int []{12,56,3,98,54,456,29};
     
124. System.out.println("排序前：");
     
125. printArray(arr);
     
126. bubbleArray(arr);
     
127. System.out.println("排序后：");
     
128. printArray(arr);
     
129. }
     
130. public static void printArray(int [] arr)
     
131. {
     
132. System.out.print("[");
     
133. for(int x=0;x<arr.length;x++)
     
134. {
     
135. 
     
136. if(x!=arr.length-1)
     
137. System.out.print(arr[x]+",");
     
138. else
     
139. System.out.println(arr[x]+"]");
     
140. }
     
141. }
     
142. public static void bubbleArray(int[] arr) {
     
143. for (int i = 0;i < arr.length-1 ;i++ ) {
     
144. for (int j = 0; j < arr.length-i-1 ;j++ ) {
     
145. if(arr[j]>arr[j+1])
     
146. {
     
147. swap(arr,j,j+1);
     
148. /*int temp = arr[j];
     
149. arr[j] = arr[j+1];
     
150. arr[j+1] = temp;*/
     
151. }
     
152. }
     
153. }
     
154. }
     
155. public static void swap(int[] arr,int a,int b) {
     
156. int temp = arr[a];
     
157. arr[a] = arr[b];
     
158. arr[b] = temp;
     
159. }
     
160. }

复制代码