Package g0401_0500.s0498_diagonal_traverse

Class Solution

java.lang.Object

g0401_0500.s0498_diagonal_traverse.Solution

public class Solution
extends Object

498 - Diagonal Traverse.<p>Medium</p> <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" alt="" /></p> <p><strong>Input:</strong> mat = [[1,2,3],[4,5,6],[7,8,9]]</p> <p><strong>Output:</strong> [1,2,4,7,5,3,6,8,9]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> mat = [[1,2],[3,4]]</p> <p><strong>Output:</strong> [1,2,3,4]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == mat.length</code></li> <li><code>n == mat[i].length</code></li> <li><code>1 <= m, n <= 10⁴</code></li> <li><code>1 <= m * n <= 10⁴</code></li> <li><code>-10⁵ <= mat[i][j] <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	findDiagonalOrder(int[][] mat)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findDiagonalOrder

public int[] findDiagonalOrder(int[][] mat)