Leetcode diagonal sum

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]

Source: grepper.com

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]);
    }
}

Source: grepper.com

Similar codes

10 votes285 views2 answers
Python convert hex number to decimal
Python
39 votes257 views2 answers
Create text in python if not exists
Python
130 votes263 views6 answers
Rename columns in dataframe
Python
0 vote250 views1 answer
Fibonacci series recursive python
Python
0 vote255 views1 answer
Plt grid linestyles options
Python
0 vote261 views1 answer
Matplotlib draw line x1, y1
Python
0 vote260 views1 answer
Ubuntu 20.10 python 3.8
Python
0 vote252 views2 answers
Get random consonant python
Python
0 vote295 views1 answer
Python not showing in control panel but showing not installed
Python
0 vote264 views2 answers
Howe to print all values and keysin d
Python