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 vote150 views1 answer
Change button background drawable in code Close
Java
1 vote163 views2 answers
Android studio set background color transparent
Java
1 vote141 views1 answer
Java date to string yyyy-mm-dd
Java
1 vote211 views1 answer
Not supported for DML operations
Java
2 votes148 views1 answer
How to print something in java
Java
0 vote147 views1 answer
How todo a timeout test java
Java
0 vote138 views1 answer
Remove unused imports android studio
Java
0 vote166 views10 answers
Convert java code to c++ online
Java
1 vote156 views1 answer
Load a file from classpath spring boot
Java
1 vote130 views1 answer
How to download java on mint
Java