Java查找矩阵的每一行和每一列的总和
Java程序来查找矩阵的每一行和每一列的总和
在此程序中，我们需要计算矩阵的每一行和每一列中元素的总和
上图显示了矩阵的每一行和每一列的元素之和。
算法
步骤1: START
步骤2: 定义rows，cols，colR，sumRow，sumCol
步骤3: 初始化矩阵a[][] = {{1，2，3}，{4，5，6}，{7，8，9}}
步骤4: rows= a.length
步骤5: cols = a [0] .length
步骤6: 直到i < rows
为止，将步骤7重复到步骤10，//for(i = 0; i < rows; i++)
步骤7: SET sumRow = 0
步骤8: 重复步骤9，直到j < cols
步骤9: sumRow = sumRow + a [i] [j]
步骤10: 打印i + 1，sumRow
步骤11: 直到i < cols
为止，将步骤12重复到步骤15 ////for(i = 0; i < cols; i++)
步骤12: SET sumCol = 0
步骤13: 重复步骤14，直到j < rows
////for(j = 0; j < rows; j++)
步骤14: sumCol = sumCol + a [j] [i]
步骤15: 打印i + 1，sumCol
STEP 16: END
程序
public class SumofRowColumn
{
public static void main(String[] args) {
int rows, cols, sumRow, sumCol;
//Initialize matrix a
int a[][] = {
{1, 2, 3},
{4, 5, 6},
{7, 8, 9}
};
//Calculates number of rows and columns present in given matrix
rows = a.length;
cols = a[0].length;
//Calculates sum of each row of given matrix
for(int i = 0;i <rows;i++){
sumRow = 0;
for(int j = 0;j <cols;j++){
sumRow = sumRow + a[i][j];
}
System.out.println("Sum of " + (i+1) +" row: " + sumRow);
}
//Calculates sum of each column of given matrix
for(int i = 0;i <cols;i++){
sumCol = 0;
for(int j = 0;j <rows;j++){
sumCol = sumCol + a[j][i];
}
System.out.println("Sum of " + (i+1) +" column: " + sumCol);
}
}
}
输出:
Sum of 1 row: 6
Sum of 2 row: 15
Sum of 3 row: 24
Sum of 1 column: 12
Sum of 2 column: 15
Sum of 3 column: 18
