Breaking News: Grepper is joining You.com. Read the official announcement!

matrix diagonal sum leetcode

Prabhu Kiran Konda answered on January 9, 2022 Popularity 10/10 Helpfulness 3/10

answer matrix diagonal sum leetcode

related matrix diagonal sum leetcode

matrix diagonal sum leetcode

Comment

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

Popularity 10/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: diagonal java matrix python sum

Link to this answer
Share Copy Link

Contributed on Jan 09 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

Closely Related Answers

matrix diagonal sum leetcode

Comment

// 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]);
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: diagonal diagona

Link to this answer
Share Copy Link

Contributed on Jan 09 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

matrix diagonal sum leetcode

Contents

More Related Answers

matrix diagonal sum leetcode

Closely Related Answers

matrix diagonal sum leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.