普通的for循环
package com.tiepi;
public class ArrayDemo {
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
//打印全部的数组元素
for (int i = 0; i < arrays.length; i++) {
System.out.println(arrays[i]);
}
//计算所有元素的和
for (int i = 0; i < arrays.length; i++) {
sum += arrays[i];
}
System.out.println("总和为:" + sum);
//查找最大元素
for (int i = 0; i < arrays.length ; i++) {
if (arrays[i]>max){
max = arrays[i];
}
}
System.out.println("最大值为:" + max);
}
}
for-each循环
package com.tiepi;
public class ArrayDemo {
//打印数组元素
public static void printArray(int[] arrays){
//增强for循环
for (int array : arrays) {
System.out.print(array+" ");
}
}
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
printArray(arrays);
}
}
数组作方法入参
package com.tiepi;
public class ArrayDemo {
//打印数组元素
public static void printArray(int[] arrays){
//增强for循环
for (int array : arrays) {
System.out.print(array+" ");
}
}
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
printArray(arrays);
}
}
数组作返回值
package com.tiepi;
public class ArrayDemo {
//反转数组
public static int[] reverse(int[] arrays){
int[] result = new int[arrays.length];
for (int i = 0, j=result.length-1; i < arrays.length; i++, j--) {
result[j] = arrays[i];
}
return result;
}
public static void main(String[] args) {
int[] arrays = {1,2,3,4,5};
int[] reverse = reverse(arrays);
for (int re : reverse) {
System.out.print(re+" ");
}
}
}