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

-2 votes253 views1 answer
Java random number between 2 numbers
Java
0 vote188 views1 answer
How to load template file from resource folder in spring boot project
Java Spring
0 vote191 views3 answers
Java 8 function supplier consumer
Java
0 vote172 views1 answer
Ex: Overflow in java
Java
1 vote161 views1 answer
How to register event spiot
Java
0 vote178 views1 answer
Java count files in folder
Java
19 votes177 views5 answers
String vs stringbuffer
Java
0 vote172 views1 answer
Java find duplicate element in list
Java
13 votes176 views3 answers
Junit dependency
Java
0 vote176 views1 answer
How to fill a 2d array in java
Java