Horje
Matrix Diagonal Sum Code Example
Matrix Diagonal Sum 
// Problem Link : https://leetcode.com/problems/matrix-diagonal-sum/

class Solution {
    public 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]);
    }
}
matrix diagonal sum Python 
# Problem Link : https://leetcode.com/problems/matrix-diagonal-sum/

class Solution(object):
    def diagonalSum(self, array):
        """
        :type array: List[List[int]]
        :rtype: int
        """
        n = len(array)
        primary = 0
        secondary = 0;
        for i in range(0, n):
            primary += array[i][i]
            secondary += array[i][n-i-1]
        if (n % 2 == 0): return primary + secondary
        else: return primary + secondary - array[n//2][n//2]



Java

Related
queue.isempty java Code Example queue.isempty java Code Example
print a letter in java Code Example print a letter in java Code Example
how to take array as an argument in java Code Example how to take array as an argument in java Code Example
slice() in typesript Code Example slice() in typesript Code Example
matrix diagonal sum leetcode Code Example matrix diagonal sum leetcode Code Example

Type:
 Code Example
Category:
 Coding
Sub Category:
 Code Example
Uploaded by:
 Admin
Views:
 10



 

Horje