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

9 votes227 views6 answers
Java remove duplicates
Java
0 vote202 views1 answer
Autowired in spring boot error creating bean with name
Java
-2 votes179 views1 answer
Java stackover
Java
0 vote194 views1 answer
Java launch exe
Java
1 vote202 views1 answer
Discord failed to install mac
Java
11 votes214 views4 answers
Convert arraylist to array in java
Java
5 votes219 views1 answer
How to configure alternative openjdk
Java
9 votes211 views6 answers
Print java
Java
0 vote237 views1 answer
Matrix multiplication in java
Java
0 vote211 views2 answers
Horizontal recyclerview item width half of screen android
Java