indexing a list with nth depths

Question

hi i am trying to make a function that can index a list and its sublists and provide their indices.

example - [2, [3,4,5,[6,[7],8] ,[9], 10. . .] so that if it hits a nested list it can output its indices somehow as well.
some sample outputs-
number | index
2 , (0)
3 , (1)
4 , (1,1)
5, (1,2)

or
index | number

ive tried recursion and its successful but i dont know how to grab their respective indices as a return. just wondering how other humans deal with a problem like this.

UPDATE ---------------------
in my original problem i was asking about enumerating indices but i think i didnt give enough information. in my hypothetical the indices could be used to 'backtrack' through the master list. so if i wanted 88 from this list

a = [2,[3,4,5],[8,[5,6,[88],7],9,10],11,[12,13,[14,15,],28]]

i would be able to get a[2][1][2] as 88. maybe is this the wrong way to do it? ( considering if the list goes too many depths down)

as always thanks for your time

-R
https://code.sololearn.com/c3SA3saJpN2n/?ref=app

Answer 1

you can use enumerate(). It returns a list of tuples that contain the index and value of each value in an iterable.

You can use a loop and isinstance() to check if it's a list, if it is, print out an enumerated version. Please also include specific input and exact output

Edit: ren[paused] it's still not entirely clear what you'd like. Can you provide specific input with the exact output?

Answer 2

It is a case of recursion:
https://code.sololearn.com/c763oRZ19EAX

Answer 3

ren[paused] The index() idea won't work for duplicate values present. Try this instead:

a = [2,[3,4,5],[8,[5,6,[88],7],9,10],11,[12,13,[14,15,],28]]

def shw_lst(li, max_depth = 99, m = [-1]):
for i in range(len(li)):
m[-1] += 1
print(f"li[{']['.join(map(str, m))}]".ljust(14), "->", k := li[i], "\n")
if max_depth < 2: return
if isinstance(k, list):
shw_lst(k, max_depth - 1, m + [-1])

shw_lst(a)

# I'm too lazy to modify this code to make it into that artwork.

# Hope this helps

Answer 4

Oma Falk
Your code is showing the index incorrectly, or I am missing something... 🤔

Answer 5

Vasiliy yep... it is depth not index

Answer 6

ren[paused] Here's my solution:

https://code.sololearn.com/cea8meoIeUQM/?ref=app

I dunno whether it meets the criteria, but... yeah.

Answer 7

hey Slick yea i was looking into that as well,
i just wanted a number , index format maybe the indexes can be separated into a tuple for easier reading. my concern was how to grab the indices even if the lists vary in depth when going through the main list

Answer 8

ren[paused] nice challenge 😁

Answer 9

✩✮★✮✩ nice! i saw something similar online, but i didnt understand what that use of [-1] was for, wouldnt that mean you are going from the tail end of the list?

Answer 10

hehe i looked at it again- i see how that would work as an exit clause thats succinct and works

Answer 11

Not exactly what you want but similar
https://code.sololearn.com/czj5sC4wDs0d/?ref=app

Answer 12

in my original problem i was asking about enumerating indices but i think i didnt give enough information. in my hypothetical the indices could be used to 'backtrack' through the master list. so if i wanted 88 from this list

a = [2,[3,4,5],[8,[5,6,[88],7],9,10],11,[12,13,[14,15,],28]]

i would be able to get a[2][1][2] as 88. maybe is this the wrong way to do it? ( considering if the list goes too many depths down)

Answer 13

@ Oma Falk im pretty sure you were the inspiration for this one from one of your previous challenges :)

Answer 14

i have to say thanks for everyones input so far!!!

Answer 15

it does - you also kept the formatting intent of the original 'gist' which was a nice touch