/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

0 vote373 views1 answer
Login views django template passing
Python Django
1 vote330 views1 answer
How To Encrypt a Python String
Python
0 vote323 views1 answer
How to import a all the modules in a packege python
Python
0 vote293 views1 answer
Get request failed python 443
Python
0 vote318 views1 answer
Filter nulla values only pandas
Python
12 votes309 views1 answer
X=x+1
Python
0 vote359 views1 answer
Find max, min character
Python
0 vote355 views1 answer
What does triple quotes mean in python
Python
0 vote331 views1 answer
Wxpython icon
Python
0 vote460 views1 answer
Rebuild database from zero django postgres
Python Django