首页 > itarticle > [lintcode] problem 905 – nested list weight sum ii

[lintcode] problem 905 – nested list weight sum ii

admin 11月 13, 2020 0

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

No.1

Input: nestedList = [[1,1],2,[1,1]]

Output: 8

Explanation:
four 1’s at depth 1, one 2 at depth 2

No.2

Input: nestedList = [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

Code

1
2
3
4
5
 
public interface  {
    public boolean isInteger();
    public Integer getInteger();
    public List<NestedInteger> getList();
}
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
 
public int depthSumInverse(List<NestedInteger> nestedList) {
    return helper(nestedList, 0);
}

private int helper(List<NestedInteger> nestedList, int intSum) {
    List<NestedInteger> nextList = new ArrayList<>();
    int listSum = 0;

    for (NestedInteger nestedInteger : nestedList) {
        if (nestedInteger.isInteger())
            intSum += nestedInteger.getInteger();
        else
            nextList.addAll(nestedInteger.getList());
    }

    if (!nextList.isEmpty())
        listSum = helper(nextList, intSum);
        
    return listSum + intSum;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能