1. 二叉树的直径(中等)
地址: https://leetcode-cn.com/problems/diameter-of-binary-tree/
2022/01/23
做题反思:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int maxDiameter = 0;
public int diameterOfBinaryTree(TreeNode root) {
maxDepth(root);
return maxDiameter;
}
int maxDepth(TreeNode root) {
if (root == null) {
return 0;
}
int maxLeft = maxDepth(root.left);
int maxRight = maxDepth(root.right);
int myDiameter = maxLeft + maxRight;
maxDiameter = Math.max(maxDiameter, myDiameter);
return Math.max(maxLeft, maxRight) + 1;
}
}
2. 寻找二叉树的叶子节点(中等)(会员)
地址: https://leetcode-cn.com/problems/find-leaves-of-binary-tree/
2022/03/09
class Solution {
public List<List<Integer>> findLeaves(TreeNode root) {
List<List<Integer>> ans = new ArrayList<List<Integer>>();
dfs(root, ans);
return ans;
}
public int dfs(TreeNode root, List<List<Integer>> ans){
if(root == null) return 0;
int l = dfs(root.left, ans);
int r = dfs(root.right, ans);
int n = Math.max(l, r);
if(n >= ans.size()) ans.add(new ArrayList<Integer>());
ans.get(n).add(root.val);
return n + 1;
}
}