数组-查找-反转-遍历-拷贝

数组的查找：查找数组中是否有指定的数值

public class ArrayTest {
    public static void main(String[] args) {
        int[] array1 = {2, 4, 5, 9, 1, 8, 2, 8};
   

 //线性查找
    boolean flag=true;
    for(int i =0;i< array1.length;i++){
        if(array1[i]==4){
            System.out.println("找到了，位置为"+i);
            flag=false;
            break;
        }
    }
    if(flag){
        System.out.println("无");}
    }
  }
  //二分法查找
  //所要查找的数组有序
          int []arry2=new int[]{1,2,3,4,5,6,7,12};
        int dest1=3;
        int head=0;//初始的首索引
        int end=arry2.length-1;//初始的末索引
        boolean flag = true;
        while (head<=end){
            int middle = (head+end)/2;
            if(dest1==arry2[middle]){
                System.out.println("找到了指定的元素，位置为:"+middle);
                flag = false;
                break;
            }
            else if(arry2[middle]>dest1){
                end = middle-1;
            }
            else{
                //arry2[middle]<dest1
                head = middle+1;
            }
        }
        if(flag){
            System.out.println("没找到");
        }
     }
    }

//数组的反转
       for(int i=0;i< array1.length/2;i++){
           int temp=array1[i];
           array1[i]= array1[array1.length-i-1];
           array1[array1.length-i-1]=temp;

       }
       for(int i=0;i< array1.length;i++){

       }
        System.out.print(Arrays.toString(array1)+" ");
        }
     }

数组的遍历：计算数组中最大、最小的值、平均值

        int [] numbers={3,10,20,50,40};
        int max=numbers[0];
        int min=numbers[0];
        int sum = 0;
        for(int i=0;i<numbers.length;i++){
            if(numbers[i]>max){
                 max= numbers[i];
            }
            if(numbers[i]<min){
                min = numbers[i];
            }
            sum+=numbers[i];
        }
        System.out.println("最大值为:"+max);
        System.out.println("最小值为:"+min);
        System.out.println("平均值为:"+(double)sum/numbers.length);
       ```

int[] numbers = {3, 14, 2, 5, 4, 7, 8, 10};
        int[] newArr = new int[numbers.length];
        for (int i = 0; i < numbers.length; i++) {
            newArr[i] = numbers[i];
        }
        System.out.println(Arrays.toString(newArr));