diagonal-traverse

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an <code>m x n</code> matrix <code>mat</code>, return an array of all the elements of the array in a diagonal order.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;" />
<pre>
Input: mat = [[1,2,3],[4,5,6],[7,8,9]]
Output: [1,2,4,7,5,3,6,8,9]
</pre>

Example 2:

<pre>
Input: mat = [[1,2],[3,4]]
Output: [1,2,3,4]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>m == mat.length</code></li>
	<li><code>n == mat[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 104</code></li>
	<li><code>1 &lt;= m * n &lt;= 104</code></li>
	<li><code>-105 &lt;= mat[i][j] &lt;= 105</code></li>
</ul>

findDiagonalOrder

Diagonal Traverse

Decode the Slanted Ciphertext

decode-the-slanted-ciphertext

解码斜向换位密码

Array

Matrix

Simulation

给你一个大小为 <code>m x n</code> 的矩阵 <code>mat</code> ，请以对角线遍历的顺序，用一个数组返回这个矩阵中的所有元素。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;" />
<pre>
输入：mat = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,4,7,5,3,6,8,9]
</pre>

示例 2：

<pre>
输入：mat = [[1,2],[3,4]]
输出：[1,2,3,4]
</pre>

&nbsp;

提示：

<ul>
	<li><code>m == mat.length</code></li>
	<li><code>n == mat[i].length</code></li>
	<li><code>1 &lt;= m, n &lt;= 104</code></li>
	<li><code>1 &lt;= m * n &lt;= 104</code></li>
	<li><code>-105 &lt;= mat[i][j] &lt;= 105</code></li>
</ul>