LeetCode1572. Matrix Diagonal Sum

本文主要是介绍LeetCode1572. Matrix Diagonal Sum，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

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

二、题解

class Solution {
public:int diagonalSum(vector<vector<int>>& mat) {int n = mat.size();int res = 0;for(int i = 0;i < n;i++){res += mat[i][i];}for(int j = n-1,i = 0;i < n && j < n;i++,j--){res += mat[i][j];}if(n % 2 == 1) res -= mat[n/2][n/2];return res;}
};

这篇关于LeetCode1572. Matrix Diagonal Sum的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---