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

0 vote357 views1 answer
Initialcontext tomcat bug
Java
0 vote378 views1 answer
Java constructor genertic
Java
10 votes340 views6 answers
Toast in android kotlin
Java
1 vote362 views1 answer
Do while jaca
Java
0 vote358 views1 answer
Youtube to mp4 stackoverflow
Java
0 vote335 views1 answer
Java set classpath
Java
0 vote421 views1 answer
Convert string to short java
Java
1 vote357 views1 answer
Java kecodes
Java
3 votes344 views2 answers
Priority queue reverse order java
Java
0 vote343 views1 answer
Double if statement java
Java