/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

4 votes150 views2 answers
Os.walk python
Python
177 votes271 views6 answers
Read file in python
Python
8 votes179 views6 answers
Pandas remove outliers
Python
1 vote195 views1 answer
From datetime to unix timestamp
Python
0 vote169 views1 answer
Transform dictionary keys python
Python
0 vote161 views1 answer
Calculating difference of elemetns in array python
Python
-4 votes234 views4 answers
Django latest version
Python Django
0 vote170 views1 answer
Keras functional api embedding layer
Python
0 vote181 views3 answers
Python remove text between parentheses
Python
0 vote190 views1 answer
Pivot table but keep nan
Python