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 vote145 views1 answer
Java find duplicate element in list
Java
-1 vote131 views2 answers
@notblank annotation spring
Java
0 vote180 views1 answer
How to find prime numbers in java
Java
0 vote150 views1 answer
Spring boot init method
Java Spring
2 votes128 views1 answer
Change kotlin to java in android studio
Java
0 vote191 views1 answer
Least significant bit java
Java
0 vote143 views1 answer
Minecraft addlayer(u) in the type rendererlivingentity<t> is not applicable for the arguments
Java
0 vote203 views1 answer
Export to csv - Java
Java
0 vote166 views1 answer
Java priority queue get first element
Java
0 vote143 views1 answer
Java Maven Using platform encoding (UTF-8 actually) to read mojo metadata, i.e. build is platform dependent!
Java