解题思路
来一次深度优先搜素,把数据放到s1中,然后复制一份到s2中,
清空s1,再来一次深度优先搜索,把数据放到s1中,然后将s1和s2进
行比对。
相关代码
/**
* 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> s1 = new ArrayList<>();
List<Integer> s2 = new ArrayList<>();
public boolean leafSimilar(TreeNode root1, TreeNode root2) {
dfs(root1);
for(int i=0;i<s1.size();i++){
int temp = s1.get(i);
s2.add(temp);
}
s1.clear();
dfs(root2);
if(s2.size()!=s1.size()) return false;
for(int i=0;i<s2.size();i++){
if(s1.get(i)!=s2.get(i)){
return false;
}
}
return true;
}
public void dfs(TreeNode root){
if(root==null) return;
if(root.left==null&&root.right==null){
s1.add(root.val);
}
dfs(root.left);
dfs(root.right);
}
}