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

5 votes148 views1 answer
Python read file without newline
Python
2 votes178 views4 answers
Django login required
Python Django
1 vote144 views1 answer
Python ieee 754 converter
Python
0 vote149 views2 answers
Python requests json backslash
Python
0 vote138 views2 answers
Negation of boolean in pyhton
Python
0 vote138 views1 answer
Install python on windows subsystem for linux
Python
2 votes141 views1 answer
Python loop list of dictionaries
Python
-2 votes127 views1 answer
Pyqt5 buttons
Python
-1 vote147 views1 answer
# get the largest number in a list and print its indexes
Python
3 votes135 views2 answers
Date object into date format python
Python