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 vote316 views1 answer
Connectionrefusederror at /accounts/signup/ django allauth
Python
0 vote324 views1 answer
Find poser hair
Python
0 vote329 views1 answer
Remove or drop rows and columns with null values
Python
0 vote342 views1 answer
Plt turn legend off
Python
2 votes299 views1 answer
When did guido van rossum create python
Python
1 vote258 views1 answer
How to set the size of a gui in python
Python
0 vote302 views1 answer
Python double indentation
Python
0 vote309 views1 answer
Python warshall algorithm stackoverflow
Python
0 vote330 views1 answer
Input and print
Python
2 votes307 views2 answers
Last element python
Python