How to realize diagonal traversal in LeetCode two-dimensional array

This article mainly introduces how to achieve diagonal traversal in the LeetCode two-dimensional array, which is very detailed and has a certain reference value. Interested friends must read it!

Topic description: "given a matrix with multiple elements, please return the elements in the matrix in diagonal traversal order."

(elements in the matrix > > a = [[1], [1], [1]]

It all becomes 1, but only the first array is set.

It turns out that if you create a two-dimensional array using multiplication, or it's not a two-dimensional array, it's just an one-dimensional array multiplied by n, and multiplication represents a reference, no matter how many subsequent arrays refer to the first array.

The correct way to create it: use the for loop

A = [] for i in range (n) above is all the content of the article "how to implement diagonal traversal in LeetCode two-dimensional array". Thank you for reading! Hope to share the content to help you, more related knowledge, welcome to follow the industry information channel!