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

0 vote145 views1 answer
Linked list implementation in Java source code
Java
10 votes137 views3 answers
Java string to long
Java
1 vote119 views1 answer
How to remove components from a JFRame java
Java
3 votes113 views2 answers
Calling startActivity() from outside of an Activity context requires the FLAG_ACTIVITY_NEW_TASK flag
Java
1 vote120 views3 answers
Recursion java
Java
0 vote113 views1 answer
How to get all of the chldren of a panel in java
Java
-2 votes120 views1 answer
Android studio remove navigation bar
Java
0 vote117 views1 answer
Quick sort in java progrmmieren
Java
1 vote128 views2 answers
Is it possible to quick sort a string in java
Java
0 vote174 views1 answer
Access each key and value in a hashmap java
Java