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 vote122 views1 answer
ArrayList<HashMap<String, String>> arrayList = new ArrayList<>()
Java
0 vote109 views1 answer
Scrollbar in textarea java
Java
0 vote127 views1 answer
New keyword in java
Java
0 vote110 views1 answer
How to take max value from priority queue in java
Java
0 vote129 views1 answer
Stringbuilder insert beginning
Java
0 vote139 views1 answer
How to reset jframe java swing
Java
0 vote104 views1 answer
Java random number generator 4
Java
0 vote115 views1 answer
How to change text of textview in slide menu bar header android
Java
3 votes154 views1 answer
App.java is not on the classpath of project
Java
0 vote195 views1 answer
Bukkit scheduler delay task
Java