#616 · #339 · Nested List Weight Sum(嵌套列表加权和)

This is an interactive problem. You are given a nested list of integers where each element is an integer or a list. Return the sum of every integer multiplied by its depth (the outermost level has depth 1). Constraints: the total number of integers is at most 50; the nesting depth is at most 50.