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

33 votes166 views4 answers
Python check folder exist
Python
0 vote194 views1 answer
Python parse /etc/resolv.conf
Python
6 votes179 views4 answers
Get channel from id discord.py
Python
35 votes177 views6 answers
Django version check
Python
0 vote168 views1 answer
Jouer à Snake
Python
5 votes150 views1 answer
Python read csv into array
Python
1 vote176 views1 answer
How to find the most similar word in a list in python
Python
4 votes164 views2 answers
How to make a screen in pygame
Python
-1 vote176 views2 answers
Dd-mm-yy to yyyy-mm-dd in python
Python
0 vote174 views1 answer
Nth term of gp in python when 2,3 terms given
Python