Java数组的基本操作

package com.ruisoft.array;


public class arryDo {


public static void main(String args[]) {
int[] arryDemo = { 1, 2, 3, 4, 5 };
// 取最大值
// printArry(arryDemo);
// 求最大值
//getMax(arryDemo);
//逆序
//reverseOne(arryDemo);
//reverseTwo(arryDemo);
//按值查找
int indexByValueOne = findByValue(arryDemo,4);
System.out.println("查找的值为："+indexByValueOne);


System.out.println("------------------");
int indexByValueTwo =findByValue(arryDemo,7);

System.out.println("查找的值为："+indexByValueTwo);




}


// 遍历
public static void printArry(int[] arry) {
for (int i = 0; i < arry.length; i++) {
if (i == 0) {
System.out.print("[" + arry[i] + ",");
} else if (i == arry.length - 1) {
System.out.print(arry[i] + "]");
} else {
System.out.print(arry[i] + ",");
}
}
}


// 求最大值
public static void getMax(int[] arry) {
int max = arry[0];


for (int i = 0; i < arry.length; i++) {
if (arry[i] > max) {
max = arry[i];
}


}
System.out.print("最大值为：" + max);


}


// 逆序
// 逆序1：
public static void reverseOne(int[] arry) {
for (int i = 0; i < arry.length / 2; i++) {
int temp = arry[i];
arry[i] = arry[arry.length - 1 - i];
arry[arry.length - 1 - i] = temp;


}
printArry(arry);
}
//逆序2：
public static void reverseTwo(int[] arry) {
for (int start = 0,end = arry.length-1; start <= end; start++,end--)
{
int temp = arry[start];
arry[start] = arry[end];
arry[end]=temp;

}
printArry(arry);


}
//查找
public static int findByValue(int[] arry,int value) {
int index = -1;
for (int i=0;i < arry.length;i++){
if(arry[i] == value){
index = i;
return  index;
}
 
}
return index;
}



}