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 vote323 views1 answer
Removing stop words from the text
Python
1 vote334 views1 answer
How to python hack 2021 course
Python
5 votes396 views1 answer
Python flask query params
Python Flask
0 vote318 views3 answers
User serializer in django rest framework
Python
3 votes306 views1 answer
Get python directiory
Python
0 vote361 views1 answer
Snake game using python
Python
0 vote319 views1 answer
Dont show certain legend labels
Python
0 vote344 views1 answer
How to know if the numbers is par in python
Python
0 vote324 views1 answer
Python glob subdirectories
Python
81 votes316 views4 answers
Python wait for x seconds
Python