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

30 votes208 views2 answers
Python clear screen windows and linux
Python
0 vote221 views1 answer
Bracket balanced or not in python
Python
1 vote242 views2 answers
'str' object has no attribute 'strftime'
Python
1 vote233 views1 answer
Python array spread
Python
2 votes225 views1 answer
Calculate market value crsp pandas
Python
12 votes221 views1 answer
How to create an env to use in vs code using anaconda
Python
8 votes245 views3 answers
Upload file in colab
Python
58 votes228 views7 answers
Pi
Python
51 votes256 views4 answers
Online python compiler with all modules
Python
1 vote229 views1 answer
How to remove b in front of python string
Python