题解 | 单组_二维数组

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		int n=scanner.nextInt();
		int m=scanner.nextInt();
		int a[][]=new int[n][m];
		Long sum=0L;
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[0].length; j++) {
				a[i][j]=scanner.nextInt();
				sum+=a[i][j];
			}
		}
		System.out.println(sum);

	}

}

这题只需要注意到遍历二维数组时，i，j的范围不一致即可解题