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

2 votes182 views2 answers
Spring boot param object
Java Spring
0 vote159 views3 answers
Power of a number in java
Java
1 vote152 views1 answer
Take string until /
Java
0 vote140 views1 answer
Spring data elasticsearch aggregation max
Java
-2 votes161 views1 answer
How to add all list elements at once in java
Java
0 vote153 views1 answer
Java convert LocalDateTime to long
Java
3 votes157 views2 answers
Java dictionary foreach
Java
0 vote165 views1 answer
Spring Boot - Hashicorp Vault Integration
Java
0 vote161 views1 answer
Set solid color background android programatically in drawable
Java
4 votes152 views4 answers
Math class in java
Java