/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 vote97 views1 answer
Shutil cut poython
Python
5 votes103 views1 answer
Python iterate through date range
Python
7 votes97 views3 answers
List of list to numpy array
Python
0 vote110 views1 answer
How to take total count of words in the list python
Python
8 votes99 views1 answer
ValueError: invalid literal for int() with base 10: site:stackoverflow.com
Python
31 votes106 views3 answers
How to add one to the index of a list
Python
1 vote102 views1 answer
Compute mfcc python
Python
1 vote59 views1 answer
How to print the max occurring in dictionary python
Python
2 votes100 views1 answer
Python method to check for uppercase character
Python
0 vote103 views1 answer
Decreasing for loop python
Python