Matrix Diagonal Sum

// 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 Python

# 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 vote332 views1 answer
Java detect new line in string
Java
7 votes362 views2 answers
Convert arraylist of integers to array primitive
Java
0 vote300 views1 answer
Java Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution.
Java
1 vote369 views1 answer
Java get ram usage
Java
0 vote340 views1 answer
How to getobject from id in controlp5
Java
159 votes560 views6 answers
Scanner in java
Java
16 votes305 views2 answers
Java how to reverse an array
Java
0 vote312 views1 answer
Execution failed for task ':app:packageDebug'. > A failure occurred while executing com.android.build.gradle.internal.tasks.Workers$ActionFacade > java.io.IOException: Failed to generate v1 signature
Java
2 votes328 views3 answers
Fill a 2d array java
Java
87 votes348 views6 answers
Hello world in java
Java