/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

11 votes173 views6 answers
Pandas distinct
Python
1 vote171 views1 answer
Merge on row number python
Python
17 votes175 views2 answers
Two loop type python
Python
0 vote236 views1 answer
Initialise tuple in python
Python
0 vote167 views1 answer
How to add user input for a question python
Python
1 vote160 views1 answer
How to print a list of strings in python
Python
0 vote177 views1 answer
Binary Search Tree
Python
168 votes260 views6 answers
How to upgrade pip in python
Python
0 vote167 views1 answer
How to fit the whole text beside checkbox in ipywidgets
Python
0 vote158 views1 answer
Pydub create empty track
Python