
方法一 遍历矩阵
如果矩阵中某个位置(x,y)处于对角线上,那么这个位置必定满足:
x=y 或 x+y = len-1 (len为矩阵长度)
javascript
var diagonalSum = function(mat) {
let len = mat.length;
let sum = 0;
for (let i = 0; i < len; i++) {
for (let j = 0; j < len; j++) {
if (i == j || i + j == len - 1) {
sum += mat[i][j];
}
}
}
return sum;
};
消耗时间和内存情况:

方法二 枚举对角线元素:
逐行遍历,记当前行号为i,每一行的对角线元素为(i,i)和(i,len-i-1)
如果len为奇数则对角线交点会被计算两次,需要减掉一次
用len&1,如果len为奇数结果为1,len为偶数结果为0
javascript
var diagonalSum = function(mat) {
let len = mat.length, mid = Math.floor(len / 2);
let sum = 0;
for (let i = 0; i < len; ++i) {
sum += mat[i][i] + mat[i][len - 1 - i];
}
return sum - mat[mid][mid] * (len & 1);
};
消耗时间和内存情况:
