• Home
• com.github.javadev
• leetcode-in-java
• 1.17
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

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

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 <= 104
*   1 <= m * n <= 104
*   -105 <= mat[i][j] <= 105