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 vote369 views1 answer
Spring boot swagger ui 401
Java Spring
59 votes321 views6 answers
Java get last element of list
Java
0 vote294 views1 answer
How to draw a circle in java swing
Java
0 vote286 views2 answers
Convert int color to hex android
Java
3 votes306 views1 answer
How to convert primitive int to Integer in java
Java
1 vote301 views1 answer
How to get the total of arraylist
Java
0 vote285 views1 answer
Attempt to invoke virtual method 'void androidx.appcompat.app.ActionBar.setTitle(java.lang.CharSequence)' on a null object reference
Java
16 votes291 views3 answers
Android java double to string
Java
0 vote326 views1 answer
Delete Specials Caractères from a String in java
Java
5 votes273 views1 answer
Is a relationship concept java
Java