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

4 votes241 views5 answers
How to use while loop in java
Java
0 vote289 views1 answer
Spring data sql not utf8
Java Spring
0 vote214 views1 answer
While (rem != 0); java
Java
0 vote236 views1 answer
Set solid color background android programatically in drawable
Java
0 vote220 views1 answer
Convert date to offsetdatetime in java
Java
0 vote229 views1 answer
Android gridview item click effect ripple
Java
1 vote233 views1 answer
How to declare list of object in java as constant
Java
0 vote242 views1 answer
How to make a ordering system in microsoft visual basic 2010 express console application
Java
3 votes221 views1 answer
How can i to do java home
Java
6 votes244 views1 answer
Best IDE for java
Java