第六·周练习

1.编写一个简单程序,要求数组长度为5,静态赋值10,20,30,40,50,在控制台输出该数组的值。

public class practice_week6 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] arr = {10,20,30,40,50};
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

}

2.编写一个简单程序,要求数组长度为5,动态赋值10,20,30,40,50,在控制台输出该数组的值。

public class practice_week6 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] arr = new int [5];
        arr[0] = 10;
        arr[1] = 20;
        arr[2] = 30;
        arr[3] = 40;
        arr[4] = 50;
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

}

3.编写一个简单程序,定义整型数组,里面的元素是{23,45,22,33,56},求数组元素的和、平均值

public class practice_week6 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] arr = {23,45,22,33,56};
        int sum = arr[0]+arr[1]+arr[2]+arr[3]+arr[4];
        int average = sum/5;
        System.out.println("数组元素的和为:" + sum);
        System.out.println("数组元素的平均值为:" + average);
    }

}

4.在一个有8个整数(18,25,7,36,13,2,89,63)的数组中找出其中最大的数及其下标。

public class practice_week6 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] arr = {18,25,7,36,13,2,89,63};
        int max = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (arr[i]>max) {
                max = arr[i];
            }
        }
        System.out.println("数组中最大的数是:"  + max);
        for (int i = 1; i < arr.length; i++) {
            if (arr[i]==max) {
                System.out.println("其下标值为:" + i);
            }
        }
    }

}

5. 将一个数组中的元素逆序存放(知识点:数组遍历、数组元素访问)

public class practice_week6 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] arr = {3,2,5,4,1};
        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i; j++) {
                if (arr[j]<arr[j+1]) {
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
    }

}

6、有一个已经排好序的数组。现输入一个数,要求按原来的规律将它插入数组中。

猜你喜欢

转载自www.cnblogs.com/guoyongqi-blog/p/12666086.html