题解 | #相逆叶子#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root1 TreeNode类 
     * @param root2 TreeNode类 
     * @return bool布尔型
     */
    public boolean leafSimilar (TreeNode root1, TreeNode root2) {
        // write code here
        StringBuilder sb1 = new StringBuilder();
        StringBuilder sb2 = new StringBuilder();
        getLeaf(root1,sb1);
        getLeaf(root2,sb2);
        return sb1.toString().equals(sb2.reverse().toString());
    }

    public void getLeaf(TreeNode root,StringBuilder sb){
        if(root == null){
            return;
        }
        if(root.left == null && root.right == null){
             sb.append(root.val);
        }
       
        getLeaf(root.left,sb);
        getLeaf(root.right,sb);
    }
}