本文介绍了在2D数组中添加对角线值的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我有以下2d数组

        int [][] array = {{ 0,  1,  2,  3,  4,  5,  6,  7,  8,  9},
                          {10, 11, 12, 13, 14, 15, 16, 17, 18, 19},
                          {20, 21, 22, 23, 24, 25, 26, 27, 28, 29},
                          {30, 31, 32, 33, 34, 35, 36, 37, 38, 39},
                          {40, 41, 42, 43, 44, 45, 46, 47, 48, 49},
                          {50, 51, 52, 53, 54, 55, 56, 57, 58, 59},
                          {60, 61, 62, 63, 64, 65, 66, 67, 68, 69},
                          {70, 71, 72, 73, 74, 75, 76, 77, 78, 79},
                          {80, 81, 82, 83, 84, 85, 86, 87, 88, 89},
                          {90, 91, 92, 93, 94, 95, 96, 97, 98, 99}};

我有这段代码来查找数组中所有值的总和。如何修改它以仅添加从0(0 + 11 + 22 + 33等)开始的对角线值?

I have this code to find the sum of all the values in the array. How can I modify it to add only the diagonal values starting at 0 (0+11+22+33 etc.)?

 public static int arraySum(int[][] array)
{
    int total = 0;

    for (int row = 0; row < array.length; row++)
    {
        for (int col = 0; col < array[row].length; col++)
            total += array[row][col];
    }

    return total;
}


推荐答案

由于对角线完美正方形,您只需要一个循环即可添加对角线。

Since the diagonals are at perfect square you only need one loop to add the diagonals.

从原点添加对角线:

public static int arraySum(int[][] array){
    int total = 0;

    for (int row = 0; row < array.length; row++)
    {

        total += array[row][row];
    }

    return total;
}






添加两个对角线:


Add both diagonals:

从原点添加对角线:(请注意,它会将中心相加两次。如果需要,可以减去一个)

Adding diagonal from orgin: (note it adds the center twice..you can subtract one if needed)

public static int arraySum(int[][] array){
    int total = 0;

    for (int row = 0; row < array.length; row++)
    {
        total += array[row][row] + array[row][array.length - row-1];
    }

    return total;
}

这篇关于在2D数组中添加对角线值的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!

09-09 15:28