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 vote196 views1 answer
Java yaml unchecked cast
Java
2 votes176 views1 answer
Groovy ternary operator
Java
0 vote235 views1 answer
Java add constructor to enum
Java
-1 vote146 views1 answer
Identify the number and its position java
Java
0 vote191 views1 answer
Example: My favorite cities
Java
0 vote182 views1 answer
Setlist arraylist java swing example
Java
0 vote204 views1 answer
Which of the following is an example of a Method reference?
Java
0 vote193 views1 answer
Date(Long) to integer and back
Java
1 vote203 views2 answers
Komplettes array ausgeben java
Java
1 vote187 views1 answer
Char variable java
Java