Matrix Diagonal Sum

// 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 Python

# 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 vote283 views1 answer
Processing draw circle
Java
0 vote290 views2 answers
Java localtime
Java
0 vote301 views1 answer
How to remove spaces from an array in java
Java
68 votes303 views6 answers
Remove duplicates from list
Java
0 vote288 views1 answer
Printing cube root of a number in java
Java
0 vote294 views1 answer
How to switch between two stylesheets in javafx.
Java
0 vote264 views1 answer
Java get wrapper class for primitive
Java
0 vote282 views1 answer
Java socket get ip address of client
Java
0 vote273 views1 answer
Are inner classes inherited
Java
1 vote271 views1 answer
How to compare lists of custom classes without defining equals() and hashCode()?
Java