Package g1401_1500.s1424_diagonal_traverse_ii

Class Solution

  • public class Solution
extends 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:** ![](https://assets.leetcode.com/uploads/2020/04/08/sample_1_1784.png) **Input:** nums = \[\[1,2,3],[4,5,6],[7,8,9]] **Output:** [1,4,2,7,5,3,8,6,9] **Example 2:** ![](https://assets.leetcode.com/uploads/2020/04/08/sample_2_1784.png) **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 Detail

      • Solution

        public Solution()

    • Method Detail

      • findDiagonalOrder

        public int[] findDiagonalOrder​(List<List<Integer>> nums)