// 遍历矩阵 int count = 0; for (int i = 0; i <= width - side; i++) { for (int j = 0; j <= length - side; j++) { // 计算正方形矩阵的和 int mSum = 0; for (int w = i; w < i + side; w++) { for (int l = j;l < j + side; l++) { mSum += matrix[w][l]; } } if (mSum > sum) { count++; } } } System.out.println(count);