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 vote346 views1 answer
@crossorigin spring allow all
Java Spring
0 vote297 views1 answer
Java timeout exception
Java
0 vote287 views1 answer
How to sum a 2d array in java
Java
0 vote279 views2 answers
Java get class by string
Java
0 vote280 views1 answer
Vowel or consonant in java using if else
Java
0 vote278 views1 answer
Get char out of string java
Java
0 vote281 views1 answer
Longadder
Java
2 votes306 views3 answers
Java thread
Java
3 votes273 views1 answer
Regrex for letter in java
Java
0 vote344 views1 answer
Spring security default username
Java Spring