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 vote298 views1 answer
Java code to print odd number
Java
0 vote279 views1 answer
Java check if a line is enclosed in quotation marks
Java
0 vote291 views1 answer
Gc algorithms java 8
Java
0 vote300 views1 answer
Java program using FileOutputStream to create a file on mac
Java
0 vote277 views1 answer
How to generate increasing random numbers in java
Java
0 vote290 views2 answers
Java choose random enum
Java
2 votes315 views10 answers
Java
Java
0 vote289 views1 answer
Center textview programmatically android
Java
0 vote256 views1 answer
Public class BigInteger { public static void main(String args[]) { long p=2147483648; } }
Java
1 vote263 views1 answer
How to compare lists of custom classes without defining equals() and hashCode()?
Java