/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 vote292 views1 answer
Pandas df count values less than 0
Python
1 vote287 views1 answer
F string curency format
Python
2 votes292 views2 answers
Php echo shorthand
Python
0 vote248 views1 answer
If we use list in the dictionary
Python
1 vote344 views1 answer
Django group by date from datetime field
Python Django
30 votes299 views6 answers
Mount drive google colab
Python
18 votes316 views3 answers
How to use histogram in python
Python
0 vote303 views1 answer
Return the intersection of this RDD and another one
Python
1 vote286 views1 answer
Alarm when code finishes
Python
21 votes277 views2 answers
Convert column to datetime format python
Python