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

11 votes307 views6 answers
If statement in python
Python
1 vote321 views2 answers
Urllib.error.HTTPError: HTTP Error 404: Not Found
Python
0 vote346 views1 answer
Python list of list to list of string
Python
0 vote340 views1 answer
How to make text change lines pygame
Python
30 votes348 views3 answers
Python read scv
Python
0 vote319 views1 answer
Pandas drop unnamed columns grebber
Python
0 vote339 views1 answer
How to read a pkl file in python
Python
0 vote321 views1 answer
Get or create django
Python
2 votes351 views1 answer
Python use tqdm with concurrent futures
Python
0 vote339 views1 answer
Pyqt5 image
Python