Leetcode diagonal sum

Matrix diagonal sum leetcode

# 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]

Source: grepper.com

Matrix diagonal sum leetcode

// Problem Link : https://leetcode.com/problems/matrix-diagonal-sum/

class Solution {
    public int diagonalSum(int[][] mat) {
        int n = mat.length;
        int principal = 0, secondary = 0;
        for (int i = 0; i < n; i++) {
            principal += mat[i][i];
            secondary += mat[i][n - i - 1];
        }
        return n%2 == 0 ? (principal + secondary) : (principal + secondary - mat[n/2][n/2]);
    }
}

Source: grepper.com

Similar codes

0 vote231 views1 answer
Python replace negative infinity
Python
0 vote207 views1 answer
Tensorboard 2.1.0 has requirement grpcio>=1.24.3, but you'll have grpcio 1.15.0 which is incompatible
Python
15 votes235 views6 answers
Dataframe to list
Python
16 votes233 views6 answers
List to Dataframe
Python
2 votes172 views1 answer
EnvironmentError command line
Python
-1 vote222 views1 answer
How to remove last character from a list in python
Python
0 vote232 views1 answer
Query json array
Python
1 vote233 views1 answer
Print string elements in list python
Python
20 votes224 views4 answers
Generate a random number in python between 0 and 1
Python
0 vote243 views1 answer
Assert raises with properties python
Python