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 vote201 views1 answer
Xtick for axvline
Python
0 vote180 views1 answer
Find position of key in dictionary python
Python
-2 votes209 views1 answer
Formatting time in python
Python
1 vote194 views1 answer
Python add item multidimensional list
Python
0 vote199 views1 answer
Python plot two lines with different y axis
Python
2 votes184 views1 answer
Change pyplot dpi
Python
4 votes197 views3 answers
How to make python speak
Python
1 vote185 views2 answers
Split dataframe into multiple parts
Python
3 votes202 views3 answers
Python get script path
Python
0 vote253 views1 answer
Python check disk space
Python