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 vote223 views1 answer
Check authorities spring
Java
1 vote241 views1 answer
Setting scale to big decimal java
Java
0 vote281 views1 answer
Spring security auto login after register
Java Spring
0 vote274 views1 answer
Spring boot get bean
Java Spring
0 vote258 views1 answer
<selector xmlns:android="http://schemas.android.com/apk/res/android><item android;drawable="@drawable/bluebtn" android: state_enabled="false"/>
Java
0 vote242 views1 answer
Spigot deal damage
Java
0 vote232 views1 answer
Servlet redirect java
Java
-1 vote247 views1 answer
Quit button java swing
Java
0 vote253 views1 answer
Java create an instance of a stack
Java
2 votes249 views2 answers
Java stream order by property
Java