364. Nested List Weight SumII

题目：
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; 13 + 42 + 6*1 = 17)

解答：
这一题其实挺tricky的，如果说第一道题的关键是记录层次，那么这一题的关键是把这一层的integer sum传到下一层去，代码如下：

public int DFS(List<NestedInteger> nestedList, int intSum) {//关键点在于把上一层的integer sum传到下一层去，这样的话，接下来还有几层，每一层都会加上这个integer sum,也就等于乘以了它的层数List<NestedInteger> nextLevel = new ArrayList<>();int listSum = 0;for (NestedInteger list : nestedList) {if (list.isInteger()) {intSum += list.getInteger();} else {nextLevel.addAll(list.getList());}}listSum = nextLevel.isEmpty() ? 0 : DFS(nextLevel, intSum);return listSum + intSum;
}public int depthSumInverse(List<NestedInteger> nestedList) {return DFS(nestedList, 0);
}

364. Nested List Weight SumII相关推荐

364. Nested List Weight Sum II
这个题做了一个多小时,好傻逼. 显而易见计算的话必须知道当前层是第几层,因为要乘权重,想要知道是第几层又必须知道最高是几层.. 用了好久是因为想ONE PASS,尝试过遍历的时候构建STACK,通过和 ...
继续过中等难度.0309
. 8 String to Integer (atoi) 13.9% Medium . 151 Reverse Words in a String 15.7% Mediu ...
Leetcode重点250题
LeetCode重点250题这个重点题目是把LeetCode前400题进行精简.精简方法如下: 删除不常考,面试低频出现题目删除重复代码题目(例:链表反转206题,代码在234题出现过) 删除过于 ...
leetcode刷题规划
LeetCode精华题目列表[刷题规划系列] – TuringPlanet 目录算法题到底在考察什么? 题目列表 Array String Linked List Queue Stack Advan ...
LeetCode All in One 题目讲解汇总(持续更新中...)
原文地址:https://www.cnblogs.com/grandyang/p/4606334.html 终于将LeetCode的大部分题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开 ...
LinkedIn TAG
1 [leetcode]243. Shortest Word Distance最短单词距离 Two Pointers 2 [leetcode]244. Shortest Word Distance I ...
LEETCODE-刷题个人笔记 Python（1-400）-TAG标签版本（二）
前面一篇由于文字太多,不给编辑,遂此篇出炉 LEETCODE-刷题个人笔记 Python(1-400)-TAG标签版本(一) DFS&BFS (262)200. Number of Islan ...
【LeetCode】深搜DFS（共85题）
[98]Validate Binary Search Tree [99]Recover Binary Search Tree [100]Same Tree [101]Symmetric Tree [1 ...
Python JAVA Solutions for Leetcode
Python & JAVA Solutions for Leetcode (inspired by haoel's leetcode) Remember solutions are only ...

364. Nested List Weight SumII

364. Nested List Weight SumII相关推荐

最新文章

热门文章