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

1 vote263 views1 answer
Requirements.txt flask
Python Flask
0 vote219 views1 answer
Computercraft turtle place block
Python
0 vote252 views1 answer
Python graphviz undirected graph
Python
4 votes260 views3 answers
Python create 2d array deep copy
Python
0 vote255 views1 answer
Python code to demonstrate inheritance with animal class
Python
0 vote256 views1 answer
Extra import on django
Python
1 vote234 views2 answers
How to get pc name with python
Python
3 votes232 views1 answer
Iteration
Python
0 vote231 views1 answer
OneHotEncoder(categorical_features=
Python
0 vote232 views1 answer
How to hack using python
Python