DAY 73 LeetCode学习笔记

前言

简单题继续干，明天下个专题

题目

官方题目

源码

/**
 * 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 {
    List<Integer> leaves1;
    List<Integer> leaves2;
    public boolean leafSimilar(TreeNode root1, TreeNode root2) {
        leaves1=new ArrayList<>();
        leaves2=new ArrayList<>();
        dfs(root1,leaves1);
        dfs(root2,leaves2);
        return leaves1.equals(leaves2);
    }
    public void dfs(TreeNode node,List<Integer>leaf){
        if(node!=null){
            if(node.left==null && node.right==null){
                        leaf.add(node.val);
                }
            dfs(node.left,leaf);
            dfs(node.right,leaf);
        }
       
    }
}