mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
42 lines
1.4 KiB
HTML
42 lines
1.4 KiB
HTML
|
<p>Given a square matrix <code>mat</code>, return the sum of the matrix diagonals.</p>
|
||
|
|
|
||
|
|
<p>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.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/14/sample_1911.png" style="width: 336px; height: 174px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> mat = [[<strong>1</strong>,2,<strong>3</strong>],
|
||
|
|
[4,<strong>5</strong>,6],
|
||
|
|
[<strong>7</strong>,8,<strong>9</strong>]]
|
||
|
|
<strong>Output:</strong> 25
|
||
|
|
<strong>Explanation: </strong>Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25
|
||
|
|
Notice that element mat[1][1] = 5 is counted only once.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> mat = [[<strong>1</strong>,1,1,<strong>1</strong>],
|
||
|
|
[1,<strong>1</strong>,<strong>1</strong>,1],
|
||
|
|
[1,<strong>1</strong>,<strong>1</strong>,1],
|
||
|
|
[<strong>1</strong>,1,1,<strong>1</strong>]]
|
||
|
|
<strong>Output:</strong> 8
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> mat = [[<strong>5</strong>]]
|
||
|
|
<strong>Output:</strong> 5
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>n == mat.length == mat[i].length</code></li>
|
||
|
|
<li><code>1 <= n <= 100</code></li>
|
||
|
|
<li><code>1 <= mat[i][j] <= 100</code></li>
|
||
|
|
</ul>
|