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

34 votes215 views6 answers
Java declare array
Java
0 vote235 views1 answer
For each loop java string array
Java
6 votes203 views2 answers
How to set the java_home in mac
Java
14 votes219 views2 answers
Why we use static in java
Java
2 votes234 views1 answer
Android string java
Java
0 vote226 views1 answer
Setting a hint on a text field in javafx
Java
0 vote247 views1 answer
Code for fibonacci numbers using For loop in Java
Java
0 vote225 views1 answer
Java regex check if group exists
Java
0 vote218 views1 answer
Java make a method that connects two strings
Java
1 vote214 views1 answer
Java structure example
Java