Java 二位数组求和

跟九九乘法表一样，判断第一个索引长度然后在遍历里面的数据

    public static void main(String[] args) {

        int[] arr = {1,3,5,7,9};
        int[] arr2 = {2,4,6,8,10};
        int[][] arr3 = {arr,arr2};

        int sum = 0;

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

            for (int j = 0; j < arr3[i].length; j++) {

                sum+=arr3[i][j];

            }
        }
        System.out.println(sum);

    }