题目描述:
示例:
解题思路:
相关代码:
class Solution {
public int diagonalSum(int[][] mat) {
int sum=0;
for(int i=0;i<mat.length;i++) {
sum+=mat[i][i]+mat[i][mat.length-i-1];
}
if(mat.length%2==1) sum-=mat[mat.length/2][mat.length/2];
return sum;
}
}