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

1 vote131 views1 answer
Calculate pi in java
Java
0 vote124 views1 answer
How to Register a Custom Auto-Configuration?
Java
2 votes130 views1 answer
Init cap java
Java
0 vote158 views1 answer
List to map of list java 8
Java
0 vote126 views1 answer
Reading data from wsdl in java
Java
3 votes132 views2 answers
Int to byte calculator
Java
1 vote128 views1 answer
Set method in listiterator in java
Java
0 vote128 views1 answer
How to convert some letters to lowercase java
Java
10 votes135 views5 answers
Sort 2d array by column java
Java
0 vote137 views1 answer
Algorithms - filtering
Java