g0401_0500.s0498_diagonal_traverse.readme.md Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.39

498\. Diagonal Traverse

Medium

Given an `m x n` matrix `mat`, return _an array of all the elements of the array in a diagonal order_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg)

**Input:** mat = [[1,2,3],[4,5,6],[7,8,9]]

**Output:** [1,2,4,7,5,3,6,8,9]

**Example 2:**

**Input:** mat = [[1,2],[3,4]]

**Output:** [1,2,3,4]

**Constraints:**

*   `m == mat.length`
*   `n == mat[i].length`
*   1 <= m, n <= 10⁴
*   1 <= m * n <= 10⁴
*   -10⁵ <= mat[i][j] <= 10⁵