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

1 vote338 views1 answer
Arrays.asLisy in java
Java
0 vote324 views1 answer
Number Formating in java by javatpoint
Java
0 vote329 views1 answer
Java delete element from list
Java
0 vote385 views1 answer
Java instanceof example
Java
13 votes314 views2 answers
Java dictionary
Java
-1 vote356 views2 answers
Java 8 datediff in days
Java
89 votes407 views5 answers
Split in java
Java
5 votes381 views3 answers
Java remove space at the end of string
Java
0 vote320 views1 answer
Mile to nautical mile
Java
5 votes328 views1 answer
Why java platform independent
Java