Bracket Depth List

Question

Challenge

Your challenge is simple, calculate the depth of each matching brackets in the given input e.g. (()()(()))->[[1,1,[1]]], and output it in the form of a list/array/string representation

Explanation:

For every bracket in the input, you have to count how many nested brackets there are for that part of the input e.g. () has 1 depth

Although if find a bracket of depth 2 e.g. (()), a list [] is formed from the 1st bracket ( ) has to be added to the output with the 2nd bracket, () of depth 1 inside that list

Test cases:

() -> [1]
[[][]] -> [[1,1]]
{}{}{{}}{{{}}} -> [1,1,[1],[[1]]

Others

You may assume that there are only lists and 1's will be in the required output

For the output, you are allowed to output the depth as a list/array, or as a string representation e.g. 1 1 [1] for ()()(())

You can output it in other ways, but the depth of the brackets must be distinguishable from each other.

Your answer should be able to handle one type of bracket (one of (), [], or {}), at your choice.

You may assume that input is balanced and only uses the type of bracket you chose.

Answer 1

Python, 236 155 bytes

def r(o):
 v="[";s=a=n=0
 for c in o:
  if c=="(":
   if s<1:a=n+1
   s+=1
  else:
   s-=1
   if a==n:v+="1,"
   elif s<1:v+=r(o[a:n])
  n+=1
 return v+"]"

Is this a good solution? No. But I don't think there'll be another answer here soon, and I'm very new to codegolf so I thought I might try my luck here :p

Attmpt this online!