Package g1401_1500.s1424_diagonal_traverse_ii

Class Solution

java.lang.Object

g1401_1500.s1424_diagonal_traverse_ii.Solution

public class Solution
extends Object

1424 - Diagonal Traverse II.<p>Medium</p> <p>Given a 2D integer array <code>nums</code>, return <em>all elements of</em> <code>nums</code> <em>in diagonal order as shown in the below images</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/04/08/sample_1_1784.png" alt="" /></p> <p><strong>Input:</strong> nums = [[1,2,3],[4,5,6],[7,8,9]]</p> <p><strong>Output:</strong> [1,4,2,7,5,3,8,6,9]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/04/08/sample_2_1784.png" alt="" /></p> <p><strong>Input:</strong> nums = [[1,2,3,4,5],[6,7],[8],[9,10,11],[12,13,14,15,16]]</p> <p><strong>Output:</strong> [1,6,2,8,7,3,9,4,12,10,5,13,11,14,15,16]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i].length <= 10⁵</code></li> <li><code>1 <= sum(nums[i].length) <= 10⁵</code></li> <li><code>1 <= nums[i][j] <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	findDiagonalOrder(List<List<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(List<List<Integer>> nums)