Ai
1 Star 0 Fork 0

徐长贺/Leetcode

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
_339.java 963 Bytes
一键复制 编辑 原始数据 按行查看 历史
Fisher Coder 提交于 2019-01-12 00:03 +08:00 . refactor 339
package com.fishercoder.solutions;
import com.fishercoder.common.classes.NestedInteger;
import java.util.List;
public class _339 {
public static class Solution1 {
private int sum = 0;
public int depthSum(List<NestedInteger> nestedList) {
return dfs(nestedList, 1);
}
private int dfs(List<NestedInteger> nestedList, int depth) {
for (NestedInteger ni : nestedList) {
if (ni.isInteger()) {
sum += depth * ni.getInteger();
} else {
dfs(ni.getList(), depth + 1);
}
}
return sum;
}
}
public static class Solution2 {
public int depthSum(List<NestedInteger> nestedList) {
return dfs(nestedList, 1);
}
private int dfs(List<NestedInteger> nestedList, int depth) {
int sum = 0;
for (NestedInteger ni : nestedList) {
sum += ni.isInteger() ? depth * ni.getInteger() : dfs(ni.getList(), depth + 1);
}
return sum;
}
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/isulong/Leetcode.git
git@gitee.com:isulong/Leetcode.git
isulong
Leetcode
Leetcode
master

搜索帮助