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 vote101 views1 answer
Columns overlap but no suffix specified: Index(['zpid'], dtype='object')
Python
21 votes95 views3 answers
Python datetime get date one week from today
Python
0 vote102 views1 answer
How do i add new items to a dictionary within a for loop python
Python
0 vote101 views1 answer
Split path in list of directories
Python
0 vote58 views1 answer
Cannot import name
Python
6 votes140 views2 answers
Flask get ip address of request
Python Flask
0 vote158 views1 answer
Discord python application bot
Python
0 vote103 views2 answers
Detect if usb is plugged in python
Python
0 vote63 views1 answer
Replace hour , minute, seconds in timestamp pandas
Python
3 votes94 views1 answer
Sklearn train_test_split
Python