class Solution {
public int diagonalSum(int[][] mat) {
int sum = 0;
for (int i = 0; i < mat.length; i++) {
//一是一个特殊情况,处理
if (mat.length == 1) {
sum += mat[i][i];
break;
}
if (mat.length % 2 == 0) {
sum += mat[i][i];
sum += mat[mat.length - i - 1][i];
} else {
sum += mat[i][i];
if (mat.length / 2 == i) continue;
sum += mat[mat.length - i - 1][i];
}
}
return sum;
}
}
leetcode 1572. 矩阵对角线元素的和
最新推荐文章于 2022-06-22 10:49:57 发布