/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 vote213 views1 answer
All python functions
Python
5 votes204 views4 answers
Pathlib get extension
Python
0 vote191 views2 answers
Python compare timestamps
Python
0 vote152 views1 answer
List.fold_left
Python
5 votes209 views4 answers
Debugging in python
Python
1 vote205 views2 answers
Python pyqt5 table widget remove horizontal header
Python
6 votes245 views2 answers
Lofi hip hop radio online
Python
0 vote188 views2 answers
Loop through list of tuples python
Python
1 vote219 views1 answer
Flask get value of radio button
Python
0 vote208 views1 answer
Np.stack
Python