algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 09:23:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update solution 1572

Browse Source
This commit is contained in:
YDZ
2021-05-22 21:29:38 +08:00
parent cd5572f250
commit 4330393c9b
12 changed files with 157 additions and 69 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
leetcode/1572.Matrix-Diagonal-Sum/README.md
View File

@ -1,31 +1,35 @@
# [1572. Matrix Diagonal Sum](https://leetcode-cn.com/problems/matrix-diagonal-sum/)
# [1572. Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)
## 题目
Given a square matrix mat, return the sum of the matrix diagonals.
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:**
![https://assets.leetcode.com/uploads/2020/08/14/sample_1911.png](https://assets.leetcode.com/uploads/2020/08/14/sample_1911.png)
```
Input: mat = [[1,2,3],
[4,5,6],
[7,8,9]]
  [4,5,6],
  [7,8,9]]
Output: 25
Explanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 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]]
  [1,1,1,1],
  [1,1,1,1],
  [1,1,1,1]]
Output: 8
```
**Example 3:**
@ -33,24 +37,23 @@ Output: 8
```
Input: mat = [[5]]
Output: 5
```
**Constraints:**
- n == mat.length == mat[i].length
- 1 <= n <= 100
- 1 <= mat[i][j] <= 100
- `n == mat.length == mat[i].length`
- `1 <= n <= 100`
- `1 <= mat[i][j] <= 100`
## 题目大意
给你一个正方形矩阵 mat，请你返回矩阵对角线元素的和。
请你返回在矩阵主对角线上的元素和副对角线上且不在主对角线上元素的和
给你一个正方形矩阵 mat，请你返回矩阵对角线元素的和。请你返回在矩阵主对角线上的元素和副对角线上且不在主对角线上元素的和。
## 解题思路
- 根据题意,把主对角线和副对角线上的元素相加
- 如果正方形矩阵的长度n为奇数，相加的结果需要减去mat[n/2][n/2]
- 简单题。根据题意，把主对角线和副对角线上的元素相加。
- 如果正方形矩阵的长度 n 为奇数，相加的结果需要减去 mat[n/2][n/2]。
## 代码
@ -63,12 +66,12 @@ func diagonalSum(mat [][]int) int {
for pi := 0; pi < n; pi++ {
ans += mat[pi][pi]
}
for si, sj := n - 1, 0; sj < n; si, sj = si - 1, sj + 1 {
for si, sj := n-1, 0; sj < n; si, sj = si-1, sj+1 {
ans += mat[si][sj]
}
if n % 2 == 0 {
if n%2 == 0 {
return ans
}
return ans - mat[n / 2][n / 2]
return ans - mat[n/2][n/2]
}
```