/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 vote126 views4 answers
Install python in dockerfile
Python
-1 vote132 views1 answer
Smma python
Python
0 vote132 views2 answers
Draw bipartite graph networkx
Python
0 vote132 views2 answers
Message: 'geckodriver' executable needs to be in PATH.
Python
3 votes134 views1 answer
Add images in readme github file
Python
2 votes131 views2 answers
Tkinter mainloop
Python
0 vote131 views1 answer
Ipynb to py online
Python
-1 vote120 views1 answer
Function TBone() if 2=2 then print("Sup") end
Python
2 votes134 views1 answer
Numpy how to slice individual columns
Python
1 vote146 views1 answer
Like in mysqldb python
Python