leetcode_404. Sum of Left Leaves-左叶子的和
来源:互联网 发布:家用配电箱品牌知乎 编辑:程序博客网 时间:2024/05/29 04:04
查找二叉树所有左叶子的和。
法1:
public int sumOfLeftLeaves(TreeNode root) { if(root == null) return 0; int ans = 0; if(root.left != null) { if(root.left.left == null && root.left.right == null) ans += root.left.val; else ans += sumOfLeftLeaves(root.left); } ans += sumOfLeftLeaves(root.right); return ans;}
法2:
public int sumOfLeftLeaves(TreeNode root) { if(root == null) return 0; int ans = 0; Stack<TreeNode> stack = new Stack<TreeNode>(); stack.push(root); while(!stack.empty()) { TreeNode node = stack.pop(); if(node.left != null) { if (node.left.left == null && node.left.right == null) ans += node.left.val; else stack.push(node.left); } if(node.right != null) { if (node.right.left != null || node.right.right != null) stack.push(node.right); } } return ans;}
0 0
- leetcode_404. Sum of Left Leaves-左叶子的和
- [LeetCode] Sum of Left Leaves 左叶子节点的和
- 404. Sum of Left Leaves求树的所有左叶子节点的和
- Leetcode 404. Sum of Left Leaves 左叶子节点的和 解题报告
- leetcode-404. Sum of Left Leaves 求左叶子节点的和,递归
- [LeetCode]404. Sum of Left Leaves(叶子结点的和)
- 【LeetCode】Sum of Left Leaves 左叶子之和
- 404. Sum of Left Leaves | 所有左子树的和
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- Sum of Left Leaves
- linux命令tr小序
- 嵌入式linux系统ARM网络培训系列教学视频
- 使用fiddler工具模拟网速
- sdk manager要下载什么
- shell中“2>&1”的含义
- leetcode_404. Sum of Left Leaves-左叶子的和
- curl 一个强大的http请求工具
- java,对象根据属性排序
- 怎么使用ABBYY中的Bates编号
- 【MOOC】Python网络爬虫与信息提取-北京理工大学-part 1
- Android触摸事件分发机制原理
- bzoj1876: [SDOI2009]SuperGCD
- Ubuntu安装jdk
- springboot 中@ConfigurationProperties和@importResource的作用和区别