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

4 votes118 views4 answers
How to create a calculator in python
Python
0 vote120 views1 answer
Count most frequent words in list python
Python
-1 vote145 views1 answer
Simple sum in python
Python
1 vote136 views1 answer
Python opencv number of frames
Python
0 vote208 views1 answer
Ternary operator using dictionary in Python
Python
0 vote122 views2 answers
Subplots
Python
0 vote141 views1 answer
Picture as background of seaborn plot python
Python
0 vote216 views2 answers
Types of methods in oop python
Python
1 vote109 views1 answer
Programe to check if a is divisible
Python
0 vote129 views1 answer
Access twitter api using tweepy in python
Python