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 vote137 views2 answers
Python sort list of integers
Python
0 vote151 views1 answer
Red black tree python
Python
1 vote154 views3 answers
Sequencia de fibonacci python
Python
0 vote148 views1 answer
Select inverse with conditions pandas
Python
0 vote143 views2 answers
Numpy random in python
Python
0 vote158 views1 answer
Dt.weekday_name
Python
0 vote148 views1 answer
Postgresql backup using python
Python
6 votes153 views1 answer
Excute a command using py in cmd
Python
0 vote116 views1 answer
Node alpine install python
Python
5 votes206 views2 answers
Python windows notification
Python