Package g1401_1500.s1424_diagonal_traverse_ii

Class Solution

java.lang.Object
g1401_1500.s1424_diagonal_traverse_ii.Solution
public class Solution extends java.lang.Object
1424 - Diagonal Traverse II.

Medium

Given a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images.

Example 1:

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

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

Example 2:

Input: nums = [[1,2,3,4,5],[6,7],[8],[9,10,11],[12,13,14,15,16]]

Output: [1,6,2,8,7,3,9,4,12,10,5,13,11,14,15,16]

Constraints:

  • 1 <= nums.length <= 105
  • 1 <= nums[i].length <= 105
  • 1 <= sum(nums[i].length) <= 105
  • 1 <= nums[i][j] <= 105

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int[]
    findDiagonalOrder(java.util.List<java.util.List<java.lang.Integer>> nums)
     

    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(java.util.List<java.util.List<java.lang.Integer>> nums)