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 vote211 views1 answer
How to change numbers to English in printf
Java
0 vote203 views1 answer
Android api 21 join list of strings
Java
0 vote214 views1 answer
Parallel sorting in java 8
Java
0 vote222 views1 answer
Generate uuid from string
Java
1 vote219 views1 answer
Gradle fatjar
Java
-2 votes219 views2 answers
What is hashset in java
Java
0 vote219 views1 answer
Com.android.okhttp.internal.http.HttpURLConnectionImpl cannot be cast to javax.net.ssl.HttpsURLConnection
Java
1 vote224 views2 answers
Is it possible to quick sort a string in java
Java
0 vote185 views1 answer
How to check instance
Java
4 votes198 views1 answer
Concurrent modification exception
Java