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 vote183 views1 answer
Android elevation not working
Java
1 vote183 views1 answer
Swapping of two numbers in java with temporary variable
Java
0 vote198 views1 answer
Java windowbuilder launch on second monitor
Java
-1 vote180 views1 answer
React-cheat-sheet
Java
1 vote174 views1 answer
Bukkit for every player
Java
35 votes188 views2 answers
Remoce last character froma java string
Java
0 vote163 views1 answer
Next method jdbc
Java
0 vote180 views1 answer
React native appearance.addchangelistener android
Java
0 vote190 views1 answer
Delete Specials Caractères from a String in java
Java
0 vote177 views1 answer
How to add music to java
Java