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 vote233 views2 answers
Hide icon android studio
Java
0 vote204 views1 answer
Detect tv remote keys andoid studio
Java
0 vote271 views1 answer
How to change background tint color programmatically android
Java
-1 vote268 views2 answers
Ejercicios resueltos de python codeskulptor
Java
0 vote189 views1 answer
Añadir objetos de diferentes clases en una misma lista
Java
1 vote205 views3 answers
Map.put in java
Java
0 vote214 views1 answer
Gradle project load test data json file with jackson
Java
0 vote216 views1 answer
Start with <> and end with <> in Java
Java
0 vote238 views1 answer
Java project with submodules
Java
0 vote202 views1 answer
Example: My favorite cities
Java