Matrix diagonal sum leetcode

// 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 leetcode

# 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 vote178 views1 answer
Short array in java
Java
0 vote181 views1 answer
Get number value of an output to another script java
Java
0 vote198 views1 answer
JAVA_HOME is not defined correctly.
Java
52 votes191 views6 answers
How to get last index of array in java
Java
0 vote222 views1 answer
Sha 1 key throguh java is not working
Java
4 votes186 views1 answer
Properties java 8 maven in pom xml
Java
2 votes186 views1 answer
Decimal up to 6 places in java
Java
0 vote218 views1 answer
Leap year java method
Java
0 vote164 views1 answer
New in t arrray java
Java
0 vote204 views1 answer
Type 'Response<any, Record<string, any>>' does not satisfy the constraint 'ServerResponse'. Types of property 'req' are incompatible.
Java