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 vote184 views1 answer
How to create folder java
Java
0 vote163 views1 answer
Jdk
Java
87 votes239 views6 answers
Hello world in java
Java
0 vote142 views1 answer
Scs
Java
0 vote166 views1 answer
BasicAWSCredentials
Java
0 vote142 views1 answer
How to compare string ignore case in java
Java
0 vote154 views1 answer
Processing - Save n number of frames
Java
1 vote168 views1 answer
Order agnostic binary search
Java
0 vote164 views1 answer
How to create a node in Java
Java
0 vote148 views1 answer
Switch case in android
Java