Nested List Weight Sum II

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

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

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:

Input: [[1,1],2,[1,1]]
Output: 8 
Explanation: Four 1's at depth 1, one 2 at depth 2.

Example 2:

Input: [1,[4,[6]]]
Output: 17 
Explanation: One 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17.

class Solution {
public:
    int depthSumInverse(vector<NestedInteger>& nestedList) {
        if (nestedList.size() == 0) {
            return 0;
        }
        queue<NestedInteger> q;
        for (auto entry : nestedList) {
            q.push(entry);
        }
        int ans = 0;
        int helper = 0;
        while (!q.empty()) {
            int size = q.size();
            for (int i = 0; i < size; i++) {
                NestedInteger entry = q.front(); q.pop();
                if (entry.isInteger()) {
                    helper += entry.getInteger();
                } else {
                    for (auto node : entry.getList()) {
                        q.push(node);
                    }
                }
            }
            ans += helper;
        }
        return ans;
    }
};

class Solution {
private:
    int getMaxDepth(vector<NestedInteger>& nestedList) {
        int depth=1;
        for (NestedInteger& ni: nestedList) {
            if (!ni.isInteger()) {
                depth = max(depth, getMaxDepth(ni.getList())+1);
            }
        }
        return depth;
    }
    int depthSumHelper(vector<NestedInteger>& nestedList, int depth) {
        int sum = 0;
        for (NestedInteger& ni: nestedList) {
            if (ni.isInteger()) {
                sum += depth * ni.getInteger();
            } else {
                sum += depthSumHelper(ni.getList(), depth-1);
            }
        }
        return sum;
    }
public:
    int depthSumInverse(vector<NestedInteger>& nestedList) {
        int depth = getMaxDepth(nestedList);
        cout<<"depth is "<<depth << endl;
        return depthSumHelper(nestedList, depth);
    }
};