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

10 votes141 views2 answers
Replace a value in arraylist java
Java
0 vote225 views1 answer
Java get parent process name
Java
0 vote256 views1 answer
Share Icon/Button
Java
0 vote175 views1 answer
Minecraft detect specific item in chest with custom name
Java
2 votes165 views1 answer
Java random uuid
Java
0 vote184 views1 answer
How to remove all items from alist in java
Java
0 vote204 views1 answer
Javafx list view does not update
Java
4 votes172 views1 answer
Not equal java
Java
26 votes177 views3 answers
Java random between
Java
0 vote206 views1 answer
Youtube to mp4 stackoverflow
Java