Matrix diagonal sum leetcode

// 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 leetcode

# 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 vote138 views3 answers
Java regex 10 digit number
Java
2 votes138 views1 answer
Spring mvc get all request parameters
Java
-1 vote131 views2 answers
Android dismiss keyboard
Java
0 vote130 views1 answer
Free pearson uk textbooks
Java
0 vote132 views1 answer
How to pass parameters to xsl file
Java
0 vote106 views1 answer
Failed to introspect Class [springfox.documentation.swagger2.configuration.Swagger2DocumentationConfiguration] from ClassLoader
Java
0 vote129 views2 answers
How to call intent in adapter class in android
Java
0 vote149 views1 answer
Important features of java programming language
Java
2 votes137 views1 answer
Java random unique key
Java
0 vote149 views1 answer
Sorting collections with comparator java
Java