/Python/Matrix diagonal sum leetcode in java

Matrix diagonal sum leetcode in java

# 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]

Similar codes

45 votes107 views6 answers
How to increase the figure size in matplotlib
Python
0 vote77 views2 answers
Business logic code where located in django rest framework
Python
4 votes111 views1 answer
Round python with list
Python
0 vote117 views1 answer
Color plt
Python
0 vote124 views1 answer
Afkastiningsgrad
Python
0 vote150 views1 answer
Python ValueError: zero-size array to reduction operation maximum which has no identity
Python
1 vote161 views2 answers
Django unique_together
Python Django
3 votes107 views1 answer
Normalize values between 0 and 1 python
Python
0 vote109 views1 answer
Getting tradingview historical data using python
Python
2 votes109 views1 answer
Get distance between 2 multidimentional point in python
Python