1572

1572. Matrix Diagonal Sum (Easy)

Given a square matrix mat, return the sum of the matrix diagonals.

Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.

 

Example 1:

Input: mat = [[1,2,3],
              [4,5,6],
              [7,8,9]]
Output: 25
Explanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
Notice that element mat[1][1] = 5 is counted only once.

Example 2:

Input: mat = [[1,1,1,1],
              [1,1,1,1],
              [1,1,1,1],
              [1,1,1,1]]
Output: 8

Example 3:

Input: mat = [[5]]
Output: 5

 

Constraints:

• n == mat.length == mat[i].length
• 1 <= n <= 100
• 1 <= mat[i][j] <= 100

Related Topics:
Array

Solution 1.

// OJ: https://leetcode.com/problems/matrix-diagonal-sum/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    int diagonalSum(vector<vector<int>>& A) {
        int N = A.size(), sum = 0;
        for (int i = 0; i < N; ++i) sum += i == N - i - 1 ? A[i][i] : (A[i][i] + A[N - i - 1][i]);
        return sum;
    }
};