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

0 vote231 views1 answer
Python linter
Python
0 vote244 views2 answers
Wav file to array python
Python
27 votes237 views2 answers
What value do we get from NULL database python
Python
1 vote235 views1 answer
How to count post by category django
Python
0 vote226 views1 answer
How did you determine the chromosome numbers and how does that relate to heredity?
Python
1 vote209 views1 answer
Localhost postgres settings django
Python Django
3 votes224 views2 answers
Python If ... Else
Python
4 votes227 views2 answers
Python list comprehension double for
Python
3 votes228 views2 answers
Python get line of exception
Python
0 vote254 views1 answer
Hash python png
Python