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]

Similar codes

4 votes364 views1 answer
Java how to calculate fps
Java
0 vote318 views1 answer
Difference between maven plugin and dependency
Java
1 vote318 views1 answer
Java jlabel border
Java
0 vote322 views1 answer
Single responsibility
Java
0 vote367 views1 answer
Java random double between 0 and 1
Java
1 vote331 views1 answer
Javafx set min window size
Java
0 vote325 views1 answer
Fragment to fragment
Java
0 vote272 views1 answer
Permutation and combination program in c
Java
0 vote347 views1 answer
TYPE_INT_ARGB
Java
1 vote313 views1 answer
Java discord bot get id of message it just sent
Java