364 Nested List Weight Sum II

364. Nested List Weight Sum II

1. Question

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: 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 17. (one 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17)

2. Implementation

(1) DFS

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * public interface NestedInteger {
 *     // Constructor initializes an empty nested list.
 *     public NestedInteger();
 *
 *     // Constructor initializes a single integer.
 *     public NestedInteger(int value);
 *
 *     // @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();
 *
 *     // Set this NestedInteger to hold a single integer.
 *     public void setInteger(int value);
 *
 *     // Set this NestedInteger to hold a nested list and adds a nested integer to it.
 *     public void add(NestedInteger ni);
 *
 *     // @return the nested list that this NestedInteger holds, if it holds a nested list
 *     // Return null if this NestedInteger holds a single integer
 *     public List<NestedInteger> getList();
 * }
 */
class Solution {
    public int depthSumInverse(List<NestedInteger> nestedList) {
        int[] maxDepth = new int[1];
        Map<Integer, Integer> map = new HashMap<>();

        dfs(nestedList, 1, map, maxDepth);
        int sum = 0;

        for (int i = 1; i <= maxDepth[0]; i++) {
            if (map.containsKey(i)) {
                sum += map.get(i) * (maxDepth[0] - i + 1);
            }
        }
        return sum;
    }

    public void dfs(List<NestedInteger> nestedList, int depth, Map<Integer, Integer> map, int[] maxDepth) {
        if (nestedList.isEmpty()) {
            return;
        }

        maxDepth[0] = Math.max(maxDepth[0], depth);

        for (NestedInteger ni : nestedList) {
            if (ni.isInteger()) {
                if (!map.containsKey(depth)) {
                    map.put(depth, ni.getInteger());
                }
                else {
                    map.put(depth, map.get(depth) + ni.getInteger());
                }
            }
            else {
                dfs(ni.getList(), depth + 1, map, maxDepth);
            }
        }
    }
}

3. Time & Space Complexity

DFS: 时间复杂度O(n), n为nestedList的所有数的个数， 空间复杂度O(k), k为nestedList中的深度