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 vote143 views1 answer
Move mouse round in python
Python
21 votes114 views2 answers
Jupyter notebook warning off
Python
0 vote122 views1 answer
How to specify port while running django project
Python
1 vote121 views1 answer
Program to segregate positive and negative numbers in same list
Python
0 vote115 views1 answer
Pyqt5 qpushbutton disable
Python
19 votes144 views2 answers
Set background colour tkinter
Python
0 vote77 views1 answer
Get parameter value dynamo python
Python
5 votes122 views1 answer
Trimming spaces in string python
Python
12 votes124 views5 answers
Is prime python
Python
35 votes136 views2 answers
How to run cmd line commands in python
Python