mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
30 lines
922 B
HTML
30 lines
922 B
HTML
<p>给你一个大小为 <code>m x n</code> 的矩阵 <code>mat</code> ，请以对角线遍历的顺序，用一个数组返回这个矩阵中的所有元素。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;" />
|
||
<pre>
|
||
<strong>输入：</strong>mat = [[1,2,3],[4,5,6],[7,8,9]]
|
||
<strong>输出：</strong>[1,2,4,7,5,3,6,8,9]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>mat = [[1,2],[3,4]]
|
||
<strong>输出：</strong>[1,2,3,4]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>m == mat.length</code></li>
|
||
<li><code>n == mat[i].length</code></li>
|
||
<li><code>1 <= m, n <= 10<sup>4</sup></code></li>
|
||
<li><code>1 <= m * n <= 10<sup>4</sup></code></li>
|
||
<li><code>-10<sup>5</sup> <= mat[i][j] <= 10<sup>5</sup></code></li>
|
||
</ul>
|