/Python/Matrix diagonal sum leetcode in Python

Matrix diagonal sum leetcode in Python

# 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

0 vote164 views2 answers
How to make a function input optional in python
Python
1 vote173 views1 answer
_set in django
Python
16 votes153 views2 answers
Python how to remove n from string
Python
0 vote200 views1 answer
Python imread multiple images
Python
0 vote171 views1 answer
Numpy second derivative of array
Python
1 vote206 views1 answer
Pyubx
Python
0 vote166 views1 answer
Tuples as return values
Python
0 vote170 views1 answer
Python csv row index is empty
Python
0 vote197 views1 answer
Django queryset group by sum
Python Django
1 vote269 views5 answers
Last index in python
Python