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-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
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:**
**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