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

13 votes89 views1 answer
All string functions in java
Java
0 vote143 views1 answer
NumberFormatException!
Java
0 vote135 views1 answer
Code wars jaden casting java
Java
-1 vote144 views1 answer
Convert Date to LocalDate via Instant
Java
0 vote163 views1 answer
Get hashmap into array
Java
0 vote133 views1 answer
Pythagoras method in java
Java
0 vote167 views1 answer
C:\elastic stack\elasticsearch-7.15.1-windows-x86_64\elasticsearch-7.15.1\bin>java -version java version "1.8.0_311" Java(TM) SE Runtime Environment (build 1.8.0_311-b11) Java HotSpot(TM) Client VM (build 25.311-b11, mixed mode, sharing)
Java
1 vote135 views1 answer
New int [] in java with assigned values
Java
15 votes140 views5 answers
How to round double to 2 decimal places java
Java
1 vote134 views1 answer
Discord jda get message by id
Java