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 vote257 views1 answer
Json payload python
Python
2 votes305 views1 answer
Use of kwargs and args in python classes
Python
4 votes341 views1 answer
Django forms set class
Python Django
0 vote309 views1 answer
Install python3 centos 7.8
Python
0 vote291 views1 answer
Which function is used to read single line from file?
Python
1 vote331 views1 answer
Import pycocotools._mask as _mask error Expected 80, got 88
Python
15 votes333 views3 answers
Decode base64 with python
Python
0 vote293 views1 answer
Django include all columns admin show
Python
11 votes306 views3 answers
Logistic regression algorithm in python
Python
0 vote332 views1 answer
Pandas pull value from column
Python