/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

60 votes255 views5 answers
Python arguments
Python
0 vote240 views3 answers
Waitress
Python
1 vote227 views1 answer
Plt.savefig cutting off labels
Python
0 vote247 views1 answer
How to update the kali linux os from python2 to python3
Python
0 vote243 views1 answer
Django queryset with multiple contain keyword
Python
0 vote237 views1 answer
How to save the command result with ! in python
Python
0 vote226 views1 answer
Python structure like c
Python
0 vote227 views1 answer
Static Assets in Django
Python
57 votes226 views11 answers
Python print color
Python
18 votes256 views1 answer
Convert column in pandas to datetime
Python