Sponsored
Sponsored
This approach uses a hash map (or dictionary) to group elements that belong to the same diagonal. The sum of indices (i + j) of each element forms a unique key for each diagonal. We iterate over the 2D list, store elements based on their diagonal key, and then read each diagonal to form the result in the required traversal order.
Time Complexity: O(N), where N is the total number of elements, as we iterate over each element, and store them in the diagonals dictionary.
Space Complexity: O(N), due to the storage requirement for the diagonals dictionary.
1var findDiagonalOrder = function(nums) {
2 let diagonals = {};
3 for (let i = 0; i < nums.length; i++) {
4 for (let j = 0; j < nums[i].length; j++) {
5 if (!(i + j in diagonals)) {
6 diagonals[i + j] = [];
7 }
8 diagonals[i + j].push(nums[i][j]);
9 }
10 }
11
12 let result = [];
13 Object.keys(diagonals).sort((a, b) => a - b).forEach(key => {
14 result.push(...diagonals[key].reverse());
15 });
16 return result;
17};In this JavaScript solution, we utilize an object (dictionary equivalent) to group elements by their diagonal key. Each diagonal is processed by reversing its array, then concatenating it to the result array. Sorting keys ensures correct diagonal processing order.
Another approach is to flatten the 2D matrix into a list of triples containing the row index, column index, and value of each element. We then sort this list, prioritizing the sum of indices (i + j), followed by reversing elements when processed within the same diagonal, ensuring the correct order for traversing.
Time Complexity: O(N log N) due to sorting operation.
Space Complexity: O(N), storing all elements in a list.
1This solution begins by constructing a list of all (row, column, value) triples from the input. It sorts this list by (i + j) as a primary key (for diagonals), and by row in reverse order as a secondary key (to meet traversal requirements), easily extracting values for the result.