Java Solution to leetcode problem 1572. Matrix Diagonal Sum
1 min read
Subscribe to my newsletter and never missmy upcoming articles
Subscribe
Given a square matrix mat, return the sum of the matrix diagonals.
Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.
Input:mat= [[1,2,3],
[4,5,6],
[7,8,9]]Output:25Explanation: Diagonals sum:1+5+9+3+7=25Noticethatelementmat[1][1]=5iscountedonlyonce.
Leetcode question link - leetcode.com/problems/matrix-diagonal-sum
Solution :-
public class Q15 {public static void main(String[] args) {int[][] mat={{1,2,3},
{4,5,6},
{7,8,9}};
System.out.println(diagonalSum(mat));
}
static int diagonalSum(int[][] mat) {int n = mat.length;int principal =0, secondary =0;for (int i =0; i < n; i++) {
principal += mat[i][i];
secondary += mat[i][n - i -1];
}return n%2==0 ? (principal + secondary) : (principal + secondary - mat[n/2][n/2]);
}
}
Like
Share this
Top comments (0)