二维数组基础

1、二维数组的输入

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
}

        /**
         *输入
         * @param arr 数组
         * @param m 行
         * @param n 列
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }
}

2、二维数组的输出

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }
}

3、求二维数组的平均值

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);
            avg(arr,3,4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }

        /**
         *求平均值
         * @param arr
         * @param m
         * @param n
         */
        public static void avg(int [][] arr,int m,int n)
        {
            System.out.println("----输出平均值-----");
            double sum = 0;
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    sum += arr[i][j];
                }
            }
            System.out.println("avg/(m*n) = " + sum / (m * n));
        }
}

4、求二维数组的最大值

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);

            allMax(arr, 3, 4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }

        /**
         * 求最大值
         * @param arr
         * @param m
         * @param n
         */
        public static void allMax(int [][] arr,int m,int n)
        {
            int max=arr[0][0],min=arr[0][0];
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    if(max<arr[i][j])
                    {
                        max=arr[i][j];
                    }
                    if(min>arr[i][j])
                    {
                        min=arr[i][j];
                    }
                }
            }
            System.out.println("max = " + max);
            System.out.println("min = " + min);
        }
}

5、求二维数组每一行的最大值

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);

            lineMax(arr, 3, 4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }

        /**
         * 求每一行的最大值
         * @param arr
         * @param m
         * @param n
         */
        public static void lineMax(int [][] arr,int m,int n)
        {
            int max;
            for (int i = 0; i < m; i++) {
                max=arr[i][0];
                for (int j = 0; j < n; j++) {
                    if(max<arr[i][j])
                    {
                        max=arr[i][j];
                    }
                }
                System.out.println("第"+(i+1)+"行的最大值是:" +max);
            }
        }
}

6、求二维数组的每一列最大值

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);

            colMax(arr,3,4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }

        /**
         * 求每一列最大值
         * @param arr
         * @param m
         * @param n
         */
        public static void colMax(int [][] arr,int m,int n)
        {
            int max;
            for (int j = 0; j < n; j++) {
                max=arr[0][j];//获取的是每一列的第一个元素
                for (int i = 0; i < m; i++) {
                    if(max<arr[i][j])
                    {
                        max=arr[i][j];
                    }
                }
                System.out.println("第"+(j+1)+"列的最大值是:" +max);
            }
        }
}

7、求矩阵除周边元素的其余元素之和

package arr2;

import java.util.Scanner;

public class ArrayStudy3 {
        public static void main(String[] args) {

            int[][] arr = new int[3][4];
            inputArray(arr,3,4);
            outArray(arr,3,4);

            sumarr(arr,4,4);
}

        /**
         *输入
         * @param arr
         * @param m
         * @param n
         */
        public static void inputArray(int [][] arr,int m,int n)
        {
            System.out.println("----二维数组元素赋初值-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("请输入第:"+(i+1)+"行的"+n+"个数据");
                for (int j = 0; j < n; j++) {
                    arr[i][j] = scanner.nextInt();
                }
            }
        }

        /**
         *输出
         * @param arr
         * @param m
         * @param n
         */
        public static void outArray(int [][] arr,int m,int n)
        {
            System.out.println("----打印二维数组矩阵-----");
            Scanner scanner = new Scanner(System.in);
            for (int i = 0; i < m; i++) {
                System.out.println("打印第:"+(i+1)+"行数据");
                for (int j = 0; j < n; j++) {
                    System.out.print(arr[i][j]+" ");
                }
                System.out.println();
            }
        }

    /**
     * 求矩阵除周边元素的其余元素之和
     * @param arr
     * @param m
     * @param n
     */
        public static void sumarr(int [][] arr,int m,int n){
            int sum=0;
            for (int i = 1; i <= m-2; i++) {
                for (int j = 1; j <= n-2; j++) {
                     sum+= arr[i][j];
                }
            }
            System.out.println("sum = " + sum);
        }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值