数组练习

//实现数组转字符串
public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(toString(arr));
    }
    public static String toString(int[] arr){
        String ret = "["；
        for(int i = 0; i<arr.length; i++){
            ret += arr[i];
            if(i != arr.length - 1){
                ret += ",";
            }
        }
        ret += "]";
        return ret;
    }
}

//拷贝数组
    int[] arr = {1,2,3,4,5,6};
    int[] newArr = Arrays.copyOf(arr,arr.length);
    System.out.println("newArr:" + Arrays.toString(newArr));

    arr[0] = 10;
    System.out.println("arr:" + Arrays.toString(arr));
    System.out.println("newArr:" + Arrays.toString(newArr));
    
    }
    public static int[] copyOf(int[] arr){
        int[] ret = new int[arr.length];
        for(int i = 0;i <arr.length;i++){
            ret[i] = arr[i];
        }
        return ret;
    }

//找数组的最大元素
public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(max(arr));
    }

    public static int max(int[] arr) {
        int max = arr[0];
         for(int i = 1; i < arr.length;i++) {
             if (arr[i] > max){
                 max = arr[i];
             }
         }
         return max;
    }
}

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(avg(arr));
    }
    //求数组中元素的平均值
    public static double avg(int[] arr) {
        int sum = 0;
        for (int x : arr) {
            sum += x;
        }
        return (double)sum / (double)arr.length;
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(find(arr, 10));
    }

    //查找数组中指定元素(顺序查找)
    public static int find(int[] arr,int toFind) {
        for(int i = 0; i < arr.length; i++) {
            if(arr[i] == toFind) {
                return i;
            }
        }
        return  -1; //表示没找到
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(binarySearch(arr, 6));
    }
    //查找数组中的指定元素(二分查找)
    public static int binarySearch(int[] arr, int toFind) {
        int left = 0;
        int right = arr.length - 1;
        while(left <= right) {
            int mid = (left + right)/2;
            if(toFind < arr[mid]) {
                right = mid - 1;
            }else if(toFind > args[mid]) {
                left = mid + 1;
            }else {
                return mid;
            }
        }
        return -1;
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4,5,6};
    System.out.println(isSoreted(arr));
    }

    //给定一个整形数组，判断是否该数组是有序的
    public static boolean isSoreted(int[] arr) {
        for (int i = 0;i < arr.length - 1;i++) {
            if (arr[i] > arr[i+1]) {
                return false;
            }
        }
        return true;
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {9,5,2,7};
    System.out.println(Arrays.toString(arr));
    }

    //冒泡排序
    public static voidbubbleSort(int[] arr) {
        for (int bound = 0; bound < arr.length; bound++) {
            for (int cur = arr.length - 1;cur > bound; cur--) {
                if (arr[cur - 1] > arr[cur]) {
                    int tmp = arr[cur - 1];
                    arr[cur - 1] = arr[cur];
                    arr[cur] = tmp;
                }
            }
        }
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4};
    System.out.println(Arrays.toString(arr));
    }

   //数组逆序
   public static void reverse(int[] arr) {
       int left = 0;
       int right = arr.length - 1;
       while (left <right) {
          int temp = arr[left];
          arr[left] = arr[right];
          arr[right] = temp;
          left++;
          right--;
        }
    }

public class Test{
    public static void main(String[] args) {
    int[] arr = {1,2,3,4};
    System.out.println(Arrays.toString(arr));
    }

//数组数字排列
   public static void transform(int[] arr) {
       int left = 0;
       int right = arr.length - 1;
       while (left <right) {
           while (left < right && arr[left] % 2 == 0) {
               left ++;
           }
           while (left < right && arr[right] % 2 != 0) {
               right--;
           }
           int tmp = arr[left];
           arr[left] = arr[right];
           arr[right] = tmp;
       }
   }