领扣LintCode算法问题答案：551. 嵌套列表的加权和

551. 嵌套列表的加权和

描述

给一个嵌套的整数列表, 返回列表中所有整数由它们的深度加权后的总和. 每一个元素可能是一个整数或一个列表(其元素也可能是整数或列表)

样例 1：

输入: 
	the list [[1,1],2,[1,1]], 
输出: 
	10. 
解释:
	four 1's at depth 2, one 2 at depth 1, 4 * 1 * 2 + 1 * 2 * 1 = 10

样例 2：

输入: 
	the list [1,[4,[6]]], 
输出: 
	27. 
解释:
	one 1 at depth 1, one 4 at depth 2, and one 6 at depth 3; 1 + 4 * 2 + 6 * 3 = 27

原题传送门

---

---

题解

/**
 * // 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 List<NestedInteger> getList();
 * }
 */
public class Solution {
    public int depthSum(List<NestedInteger> nestedList) {
        // Write your code here
        int ret = depthSum(nestedList, 1);
        return ret;
    }

    private int depthSum(List<NestedInteger> nestedList, int depth) {
        int ret = 0;
        for (NestedInteger nestedInteger : nestedList) {
            if (nestedInteger.isInteger()) {
                ret += nestedInteger.getInteger() * depth;
            } else {
                ret += this.depthSum(nestedInteger.getList(), depth + 1);
            }
        }
        return ret;
    }
}

最后说两句

非常感谢你阅读本文章，如果你觉得本文对你有所帮助，请留下你的足迹，点个赞，留个言，多谢~

作者水平有限，如果文章内容有不准确的地方，请指正。

希望小伙伴们都能每天进步一点点。

声明

本文由二当家的白帽子博客原创，转载请注明来源，谢谢~