1 package com.pingfan.array;
2
3 public class ArrayDemo3 {
4 public static void main(String[] args) {
5 int[] arrays = {1,2,3,4,5};
6 //打印全部的数组元素
7 for (int i = 0; i < arrays.length; i++) {
8 System.out.println(arrays[i]);
9 }
10 System.out.println("=========");
11 //计算所有元素的和
12 int sum = 0;
13 for (int i = 0; i < arrays.length; i++) {
14 sum = sum + arrays[i];
15 }
16 System.out.println("sum" + sum);
17 System.out.println("=========");
18 //查找最大元素
19 int max = arrays[0];
20
21 for (int i = 1; i < arrays.length; i++) {
22 if (arrays[i]>max){
23 max = arrays[i];
24 }
25 }
26 System.out.println("max=" + max);
27 }
28 }
1 package com.pingfan.array;
2
3 public class ArrayDemo4 {
4 public static void main(String[] args) {
5 int[] arrays = {1,2,3,4,5};
6 // //JDK1.5 没有下标
7 // for (int array : arrays) {
8 // System.out.println(array);
9 // }
10 //printArray(arrays);
11 int[] reverse = reverse(arrays);
12 printArray(reverse);
13 }
14 //反转数组
15 public static int[] reverse(int[] arrays){
16 int[] result = new int[arrays.length];
17
18 //反转的操作
19 for (int i = 0,j = result.length-1; i < arrays.length; i++,j--) {
20 result[j] = arrays[i];
21 }
22 return result;
23 }
24
25
26 //打印数组元素
27 public static void printArray(int[] arrays){
28 for (int i = 0; i < arrays.length; i++) {
29 System.out.println(arrays[i] + " ");
30 }
31 }
32 }