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 vote286 views1 answer
Java format use same value multiple times
Java
22 votes329 views2 answers
System.out.println
Java
0 vote298 views1 answer
Java como comprobar que un numero es entero?
Java
11 votes266 views3 answers
Iterate enum java
Java
0 vote305 views1 answer
Convert object address to string in java
Java
0 vote291 views1 answer
Android Gradle plugin requires Java 11 to run. You are currently using Java 1.8.
Java
0 vote326 views1 answer
Priority scheduling in java
Java
4 votes303 views2 answers
Foreach loop java values hashmap
Java
0 vote323 views1 answer
Stringbuilser
Java
-2 votes333 views1 answer
Java get class by string name
Java