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 vote196 views1 answer
Python install tabulate
Python
1 vote174 views1 answer
Selenium close browser
Python
57 votes184 views6 answers
Print current date and time in python
Python
0 vote192 views1 answer
How to make download link in Jupyter appmode
Python
10 votes190 views1 answer
Pandas select by column value
Python
68 votes182 views6 answers
Python list files in directory
Python
0 vote198 views1 answer
Django pull from Google Sheets
Python
-2 votes197 views6 answers
Django download
Python
0 vote196 views1 answer
Entry point to programming Spark with the Dataset and DataFrame API
Python
13 votes176 views3 answers
Pygame mouse pos
Python