房上的猫：数组插入算法等难点专开

public class Aini {

    public static void main(String[] args) {
        // 数组查找算法
        // 查找学生是否存在
        // 导入扫描仪
        Scanner bdqn = new Scanner(System.in);
        System.out.println("请输入你要查找的学生：");
        String name = bdqn.next();
        String[] arrs = { "王二", "张三", "李四", "王五", "六麻子" };
        int en = arrs.length;// 记录一个不可能的下标
        for (int i = 0; i < arrs.length; i++) {
            if (name.equals(arrs[i])) {
                en = i;
                break;
            }
        }
        if (en < arrs.length) {
            System.out.println("学生：" + name + "存在，下表是" + en);
        } else {
            System.out.println("学生：" + name + "不存在");
        }
    }
}

public class Aini {

    public static void main(String[] args) {
        // 数组复制算法
        int[] arr1 = { 100, 800, 500, 600, 700 };
        int[] arr2 = new int[arr1.length];
        // 用for循环吧1的对应下标值复制给2
        for (int i = 0; i < arr1.length; i++) {
            arr2[i] = arr1[i];
        }
        // 输出arr2
        for (int i = 0; i < arr2.length; i++) {
            System.out.println(arr2[i]);
        }
    }
}

public class Aini {

    public static void main(String[] args) {
        // 导入扫描仪
        Scanner bdqn = new Scanner(System.in);
        // 数组插入算法
        int[] arr1 = { 100, 800, 500, 600, 700, 1 };
        System.out.println("请输入你想要插入的值");
        int num = bdqn.nextInt();
        arr1[arr1.length - 1] = num;
        for (int i = arr1.length - 1; i > 0; i--) {
            int a = arr1[i];
            arr1[i] = arr1[i - 1];
            arr1[i - 1] = a;
        }
        // 输出
        for (int i = 0; i < arr1.length; i++) {
            System.out.println(arr1[i]);
        }
    }
}