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 vote213 views1 answer
Beautifulsoup remove element
Python
1 vote697 views1 answer
How to check which submit button is clicked in flask wtf
Python
0 vote319 views1 answer
Django queryset last 10
Python Django
0 vote301 views1 answer
How to convert a matrix string back to a matrix python
Python
-1 vote310 views3 answers
Casefold in python
Python
3 votes291 views3 answers
Python zip()
Python
1 vote257 views1 answer
Python for dummies
Python
0 vote267 views1 answer
Name =input ("hello how are you ") if name==("good"): print ("Thats nice") else print("stfu")
Python
5 votes271 views1 answer
Datetime 30 days ago python
Python
19 votes277 views1 answer
Transform size of picture pygame
Python