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 vote386 views1 answer
Set solid color background android programatically in drawable
Java
0 vote338 views1 answer
Print out whole array java
Java
0 vote360 views1 answer
Open google maps cycling navigation
Java
0 vote343 views1 answer
How to draw a triangle in java
Java
0 vote349 views2 answers
Can abstract class have non abstract methods in java
Java
0 vote366 views3 answers
Maths.random in Java
Java
6 votes341 views1 answer
How to remove character from stringbuilder in java
Java
0 vote359 views1 answer
How to add spaces before string in java
Java
0 vote328 views1 answer
Using addition to multiply in java
Java
0 vote402 views2 answers
Android listen to network change
Java