Package g0401_0500.s0498_diagonal_traverse

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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

    • <code>1 <= m, n <= 10<sup>4</sup></code>

    • <code>1 <= m * n <= 10<sup>4</sup></code>

    • <code>-10<sup>5</sup><= matj<= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray findDiagonalOrder(Array<IntArray> mat)

      • Methods inherited from class java.lang.Object

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