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

12 votes161 views2 answers
Java date time
Java
0 vote135 views2 answers
Create a recursive function to calculate the greatest common divisor in java
Java
-4 votes164 views4 answers
How to use Add Grepper Answer (a)
Java
0 vote178 views1 answer
Java bter data atual no padrão brasileiro
Java
3 votes125 views2 answers
How to split a string space for numbers in java
Java
1 vote180 views2 answers
Delete ending part of the string java
Java
0 vote170 views1 answer
Detect tv remote keys andoid studio
Java
0 vote167 views2 answers
Localtime java
Java
1 vote129 views1 answer
Localdate get last day of month java
Java
0 vote171 views1 answer
How to read text file as variable in java
Java