Write python code to determine list depth

Mainly for nested list issues. List set list, which is deeper than the sub-list...

This problem is annoying. If you nest 100 million lists, do you want to count 10000 and then sort them?

Finally, I tried to use the extend function of list and the recursive function. The Code is as follows:

L1 = [1, 'A', [1], [, [, [, [], [, [], [4], [5], [6] # l1 = [1, 2, [3, [4, 5], 6, [7, 8, [9, 10], 11], 12], 13] count = 1def func (l): global count temp_list = [] for l2 in l: if isinstance (l2, list) = True: temp_list.extend (l2) if len (temp_list)> 0: count + = 1 func (temp_list) func (l1) print count