“Matrix Diagonal Sum Leetcode” Kode Jawaban

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]
Prabhu Kiran Konda

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]);
    }
}
Prabhu Kiran Konda

Jawaban yang mirip dengan “Matrix Diagonal Sum Leetcode”

Pertanyaan yang mirip dengan “Matrix Diagonal Sum Leetcode”

Lebih banyak jawaban terkait untuk “Matrix Diagonal Sum Leetcode” di Java

Jelajahi jawaban kode populer menurut bahasa

Jelajahi bahasa kode lainnya