image_2021-10-17_00-54-15.png
33.6 KB
#N1572 Matrix Diagonal Sum
problem link=>https://leetcode.com/problems/matrix-diagonal-sum/
#solution
problem link=>https://leetcode.com/problems/matrix-diagonal-sum/
#solution
class Solution {
public int diagonalSum(int[][] mat) {
int sum=0;
for(int i=0, j=0; i<mat.length; i++, j++){
sum+=mat[i][j]+mat[i][mat.length-j-1];
}
if(mat.length%2==1){
sum-=mat[(mat.length-1)/2][(mat.length-1)/2];
}
return sum;
}
}