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 vote158 views1 answer
Python covid data
Python
17 votes150 views2 answers
Make selenium headless python
Python
0 vote152 views1 answer
Python to apk converter software download for pc
Python
0 vote152 views1 answer
How to import date python
Python
0 vote154 views1 answer
Python all possible pairs
Python
28 votes161 views2 answers
Wintp python manage.py createsuperuser
Python
0 vote169 views1 answer
Sikuli guide text
Python
0 vote142 views1 answer
Python Name Genorator pip install command
Python
0 vote153 views1 answer
[Solved] TypeError: 'NoneType' object is not subscriptable
Python
8 votes213 views2 answers
Flask.pocoo.org quickstart
Python Flask