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 vote363 views1 answer
Java program pattern program to triangle using 100 numbers
Java
0 vote380 views1 answer
Priority scheduling in java
Java
0 vote375 views1 answer
First and last element of array java
Java
0 vote376 views2 answers
Devoluciones redsys api
Java
0 vote363 views2 answers
How to remove null values collections
Java
0 vote368 views1 answer
Castle stones java qn
Java
0 vote361 views1 answer
Java.lang.long cannot be cast to java.lang.integer
Java
4 votes357 views2 answers
Java make object
Java
0 vote352 views1 answer
Matrix multiplication javascrpt
Java
3 votes361 views1 answer
More than one file was found with OS independent path 'META-INF/metadata.jvm.kotlin_module'
Java