/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 vote175 views1 answer
Python how to make a png
Python
-1 vote160 views1 answer
Comment faire pour retourner une liste python
Python
2 votes160 views1 answer
How to autosave in python
Python
0 vote165 views1 answer
Python - matching people based on city
Python
6 votes157 views3 answers
Messages django
Python
33 votes142 views2 answers
Find a largest number in function list python
Python
-1 vote170 views1 answer
How to make take command in python
Python
0 vote150 views1 answer
No name 'QMessageBox' in module 'PyQt5.QtWidgets'
Python
1 vote161 views1 answer
Python sqlite dict
Python
0 vote196 views1 answer
Discord bot delete messages python
Python