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

2 votes296 views1 answer
From string to double andoird studio
Java
1 vote287 views1 answer
Java check if int is null
Java
26 votes285 views6 answers
Java list to array
Java
0 vote335 views1 answer
Jasypt-spring-boot
Java Spring
0 vote278 views1 answer
Barcode design in postgresql
Java
1 vote305 views1 answer
Pycharm qt designer
Java
0 vote313 views1 answer
In java write a code that suppose the following input is supplied to the program: 9 Then, the output should be: 12096 (99+999+9999+999)
Java
0 vote305 views1 answer
Java animated gif example
Java
0 vote300 views1 answer
Madrid
Java
0 vote307 views1 answer
List into string java
Java