Leetcode: Nested List Weight Sum

Given a nested list of integers, return the sum of all integers in the list weighted by their depth.

Different from the previous question where weight is increasing from root to leaf, now the weight is defined from bottom up. i.e., the leaf level integers have weight 1, and the root level integers have the largest weight.

Example 1:

Given the list [[1,1],2,[1,1]], return 8. (four 1's at depth 1, one 2 at depth 2)

Example 2:

Given the list [1,[4,[6]]], return 27. (one 1 at depth 1, one 4 at depth 2, and one 6 at depth 3; 1*1 + 4*2 + 6*3 = 27)

从这两个example，我们可以知道这个题目应该用递归的方法，在递归每深入一层的时候，我们要注意depth 加 1.

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * public interface NestedInteger {
 *
 *     // @return true if this NestedInteger holds a single integer,
 *     // rather than a nested list.
 *     public boolean isInteger();
 *
 *     // @return the single integer that this NestedInteger holds,
 *     // if it holds a single integer
 *     // Return null if this NestedInteger holds a nested list
 *     public Integer getInteger();
 *
 *     // @return the nested list that this NestedInteger holds,
 *     // if it holds a nested list
 *     // Return null if this NestedInteger holds a single integer
 *     public vector<NestedInteger> getList();
 * }
 */

public Solution {
    public int depthSum(vector<NestedInteger> nestedList) {
    // Write your code here
        return helper(nestedList, 1);
    }
    
    private int helper(vector<NestedInteger> list, int depth) {
        int sum = 0;
        if (nestedList.size() == 0) {
            return sum;
        }
        for (auto it : list) {
            sum += 
                it.isInteger() ? 
                depth * it.getInteger() : 
                helper(it.getList(), depth+1);
        }
        return sum;
    }
}