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

1 vote395 views1 answer
Problem adding rectangle in javaFX
Java
0 vote338 views1 answer
How to convert a number into a decimal number in java
Java
6 votes341 views2 answers
Java simpledateformat example
Java
0 vote362 views2 answers
How to use asynx task to make api connection java
Java
0 vote345 views1 answer
Abstractannotationconfigdispatcherservletinitializer maven dependency
Java
1 vote344 views1 answer
Count occurrences of character in string java 8
Java
2 votes341 views1 answer
Como crear un array en java
Java
15 votes328 views2 answers
Convert text type to int java
Java
0 vote370 views1 answer
Java minimize all windows
Java
0 vote337 views1 answer
Android java how to blur an image
Java